{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/meta-reinforcement-learning-of-structured","title":"Meta-Reinforcement Learning of Structured Exploration Strategies","arxiv_id":"1802.07245","date":"2018-02-20","proceeding":"NeurIPS 2018 12","authors":["Abhishek Gupta","Russell Mendonca","Yuxuan Liu","Pieter Abbeel","Sergey Levine"],"abstract":"Exploration is a fundamental challenge in reinforcement learning (RL). Many\nof the current exploration methods for deep RL use task-agnostic objectives,\nsuch as information gain or bonuses based on state visitation. However, many\npractical applications of RL involve learning more than a single task, and\nprior tasks can be used to inform how exploration should be performed in new\ntasks. In this work, we explore how prior tasks can inform an agent about how\nto explore effectively in new situations. We introduce a novel gradient-based\nfast adaptation algorithm -- model agnostic exploration with structured noise\n(MAESN) -- to learn exploration strategies from prior experience. The prior\nexperience is used both to initialize a policy and to acquire a latent\nexploration space that can inject structured stochasticity into a policy,\nproducing exploration strategies that are informed by prior knowledge and are\nmore effective than random action-space noise. We show that MAESN is more\neffective at learning exploration strategies when compared to prior meta-RL\nmethods, RL without learned exploration strategies, and task-agnostic\nexploration methods. We evaluate our method on a variety of simulated tasks:\nlocomotion with a wheeled robot, locomotion with a quadrupedal walker, and\nobject manipulation.","url_abs":"http://arxiv.org/abs/1802.07245v1","url_pdf":"http://arxiv.org/pdf/1802.07245v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"meta-reinforcement-learning-of-structured","repo_url":"https://github.com/russellmendonca/maesn_suite","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"meta-reinforcement-learning-of-structured","repo_url":"https://github.com/llan-ml/tesp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"meta-reinforcement-learning","task_name":"Meta Reinforcement Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.07245","atlas_url":"https://app.syntology.ai/?focus=1802.07245","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1802.07245"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.07245\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.07245"},"call":"get_concepts_for_paper(arxiv_id=\"1802.07245\")"}],"by_repo":[{"repo":"russellmendonca/maesn_suite","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"llan-ml/tesp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6526aa1af5c66cfce808b40b42d04909eb86507b7b19af7667ece61f62491526","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}