{"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/some-considerations-on-learning-to-explore","title":"Some Considerations on Learning to Explore via Meta-Reinforcement Learning","arxiv_id":"1803.01118","date":"2018-03-03","proceeding":"ICLR 2018 1","authors":["Bradly C. Stadie","Ge Yang","Rein Houthooft","Xi Chen","Yan Duan","Yuhuai Wu","Pieter Abbeel","Ilya Sutskever"],"abstract":"We consider the problem of exploration in meta reinforcement learning. Two\nnew meta reinforcement learning algorithms are suggested: E-MAML and\nE-$\\text{RL}^2$. Results are presented on a novel environment we call `Krazy\nWorld' and a set of maze environments. We show E-MAML and E-$\\text{RL}^2$\ndeliver better performance on tasks where exploration is important.","url_abs":"http://arxiv.org/abs/1803.01118v2","url_pdf":"http://arxiv.org/pdf/1803.01118v2.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":"some-considerations-on-learning-to-explore","repo_url":"https://github.com/episodeyang/e-maml","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"some-considerations-on-learning-to-explore","repo_url":"https://github.com/Zhiwei-Z/PrompLimitTest","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"some-considerations-on-learning-to-explore","repo_url":"https://github.com/Zhiwei-Z/SeqPromp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"some-considerations-on-learning-to-explore","repo_url":"https://github.com/Zhiwei-Z/prompzzw","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"some-considerations-on-learning-to-explore","repo_url":"https://github.com/clrrrr/promp_plus","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"some-considerations-on-learning-to-explore","repo_url":"https://github.com/jonasrothfuss/promp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"some-considerations-on-learning-to-explore","repo_url":"https://github.com/mazpie/mime","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","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/1803.01118","atlas_url":"https://app.syntology.ai/?focus=1803.01118","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":"1803.01118"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.01118\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.01118"},"call":"get_concepts_for_paper(arxiv_id=\"1803.01118\")"}],"by_repo":[{"repo":"episodeyang/e-maml","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Zhiwei-Z/PrompLimitTest","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Zhiwei-Z/SeqPromp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1703.03400"],"harvested_for_calls":[{"arxiv_id":"1703.03400","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.03400"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.03400\")"}]},{"repo":"Zhiwei-Z/prompzzw","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"clrrrr/promp_plus","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1703.03400"],"harvested_for_calls":[{"arxiv_id":"1703.03400","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.03400"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.03400\")"}]},{"repo":"jonasrothfuss/promp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1810.06784","2105.13524"],"harvested_for_calls":[{"arxiv_id":"1810.06784","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1810.06784"},"call":"get_harvested_code_for_paper(arxiv_id=\"1810.06784\")"},{"arxiv_id":"2105.13524","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.13524"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.13524\")"}]},{"repo":"mazpie/mime","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"645af3834b1f04db775023aea36a7079312ab3b6d30da99ce3eb4174d1707835","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}