{"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/ride-rewarding-impact-driven-exploration-for-1","title":"RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated Environments","arxiv_id":"2002.12292","date":"2020-02-27","proceeding":"ICLR 2020 1","authors":["Roberta Raileanu","Tim Rocktäschel"],"abstract":"Exploration in sparse reward environments remains one of the key challenges of model-free reinforcement learning. Instead of solely relying on extrinsic rewards provided by the environment, many state-of-the-art methods use intrinsic rewards to encourage exploration. However, we show that existing methods fall short in procedurally-generated environments where an agent is unlikely to visit a state more than once. We propose a novel type of intrinsic reward which encourages the agent to take actions that lead to significant changes in its learned state representation. We evaluate our method on multiple challenging procedurally-generated tasks in MiniGrid, as well as on tasks with high-dimensional observations used in prior work. Our experiments demonstrate that this approach is more sample efficient than existing exploration methods, particularly for procedurally-generated MiniGrid environments. Furthermore, we analyze the learned behavior as well as the intrinsic reward received by our agent. In contrast to previous approaches, our intrinsic reward does not diminish during the course of training and it rewards the agent substantially more for interacting with objects that it can control.","url_abs":"https://arxiv.org/abs/2002.12292v2","url_pdf":"https://arxiv.org/pdf/2002.12292v2.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":"ride-rewarding-impact-driven-exploration-for-1","repo_url":"https://github.com/facebookresearch/impact-driven-exploration","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"ride-rewarding-impact-driven-exploration-for-1","repo_url":"https://github.com/balloch/rl-exploration-transfer","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"ride-rewarding-impact-driven-exploration-for-1","repo_url":"https://github.com/rle-foundation/rlexplore","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"ride-rewarding-impact-driven-exploration-for-1","repo_url":"https://github.com/uoe-agents/derl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2002.12292","atlas_url":"https://app.syntology.ai/?focus=2002.12292","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":"2002.12292"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2002.12292\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2002.12292"},"call":"get_concepts_for_paper(arxiv_id=\"2002.12292\")"}],"by_repo":[{"repo":"facebookresearch/impact-driven-exploration","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"balloch/rl-exploration-transfer","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1810.12894","2002.06038"],"harvested_for_calls":[{"arxiv_id":"1810.12894","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1810.12894"},"call":"get_harvested_code_for_paper(arxiv_id=\"1810.12894\")"},{"arxiv_id":"2002.06038","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2002.06038"},"call":"get_harvested_code_for_paper(arxiv_id=\"2002.06038\")"}]},{"repo":"rle-foundation/rlexplore","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"uoe-agents/derl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1705.05363","1810.12894"],"harvested_for_calls":[{"arxiv_id":"1705.05363","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1705.05363"},"call":"get_harvested_code_for_paper(arxiv_id=\"1705.05363\")"},{"arxiv_id":"1810.12894","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1810.12894"},"call":"get_harvested_code_for_paper(arxiv_id=\"1810.12894\")"}]}],"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":"65179af2302ae087491aab39e22cc0c797b545cf27992fadee202892abab9c46","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}