{"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":"/method/go-explore","slug":"go-explore","name":"Go-Explore","full_name":"Go-Explore","full_name_withheld":false,"description_markdown":"**Go-Explore** is a family of algorithms aiming to tackle two challenges with effective exploration in reinforcement learning: algorithms forgetting how to reach previously visited states (\"detachment\") and from failing to first return to a state before exploring from it (\"derailment\").\r\n\r\nTo avoid detachment, Go-Explore builds an archive of the different states it has visited in the environment, thus ensuring that states cannot be forgotten. Starting with an archive beginning with the initial state, the archive is built iteratively. In Go-Explore we:\r\n\r\n(a) Probabilistically select a state from the archive, preferring states associated with promising cells. \r\n\r\n(b) Return to the selected state, such as by restoring simulator state or by running a goal-conditioned policy. \r\n\r\n(c) Explore from that state by taking random actions or sampling from a trained policy. \r\n\r\n(d) Map every state encountered during returning and exploring to a low-dimensional cell representation. \r\n\r\n(e) Add states that map to new cells to the archive and update other archive entries.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Go-Explore: a New Approach for Hard-Exploration Problems","paper":"/paper/go-explore-a-new-approach-for-hard","first_author":"Adrien Ecoffet","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/go-explore-a-new-approach-for-hard"},"source":{"url":"https://arxiv.org/abs/1901.10995v4","title":"Go-Explore: a New Approach for Hard-Exploration Problems","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Behaviour Policies","url":"/methods/category/behaviour-policies","pwc_aliases":[]}],"n_papers_tagged":16,"archive_num_papers":16,"papers_newest_first":[{"paper":"/paper/intelligent-go-explore-standing-on-the","slug":"intelligent-go-explore-standing-on-the","title":"Intelligent Go-Explore: Standing on the Shoulders of Giant Foundation Models","date":"2024-05-24","arxiv_id":"2405.15143","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["conglu1997/intelligent-go-explore"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"go-explore-for-residential-energy-management","title":"Go-Explore for Residential Energy Management","date":"2024-01-15","arxiv_id":"2401.07710","n_code_links":0,"syntology":null},{"paper":null,"slug":"curiosity-driven-exploration-in-sparse-reward","title":"Curiosity-driven Exploration in Sparse-reward Multi-agent Reinforcement Learning","date":"2023-02-21","arxiv_id":"2302.10825","n_code_links":0,"syntology":null},{"paper":"/paper/time-myopic-go-explore-learning-a-state","slug":"time-myopic-go-explore-learning-a-state","title":"Time-Myopic Go-Explore: Learning A State Representation for the Go-Explore Paradigm","date":"2023-01-13","arxiv_id":"2301.05635","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":0,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["hauf3n/time-myopic-go-explore"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"first-go-then-post-explore-the-benefits-of","title":"First Go, then Post-Explore: the Benefits of Post-Exploration in Intrinsic Motivation","date":"2022-12-06","arxiv_id":"2212.03251","n_code_links":0,"syntology":null},{"paper":null,"slug":"quality-diversity-in-dissimilarity-spaces","title":"Quality-diversity in dissimilarity spaces","date":"2022-11-14","arxiv_id":"2211.12337","n_code_links":0,"syntology":null},{"paper":null,"slug":"go-explore-complex-3d-game-environments-for","title":"Go-Explore Complex 3D Game Environments for Automated Reachability Testing","date":"2022-09-01","arxiv_id":"2209.00570","n_code_links":0,"syntology":null},{"paper":"/paper/cell-free-latent-go-explore","slug":"cell-free-latent-go-explore","title":"Cell-Free Latent Go-Explore","date":"2022-08-31","arxiv_id":"2208.14928","n_code_links":1,"syntology":null},{"paper":null,"slug":"generative-personas-that-behave-and","title":"Generative Personas That Behave and Experience Like Humans","date":"2022-08-26","arxiv_id":"2209.00459","n_code_links":0,"syntology":null},{"paper":null,"slug":"play-with-emotion-affect-driven-reinforcement","title":"Play with Emotion: Affect-Driven Reinforcement Learning","date":"2022-08-26","arxiv_id":"2208.12622","n_code_links":0,"syntology":null},{"paper":null,"slug":"when-to-go-and-when-to-explore-the-benefit-of","title":"When to Go, and When to Explore: The Benefit of Post-Exploration in Intrinsic Motivation","date":"2022-03-29","arxiv_id":"2203.16311","n_code_links":0,"syntology":null},{"paper":null,"slug":"go-blend-behavior-and-affect","title":"Go-Blend behavior and affect","date":"2021-09-24","arxiv_id":"2109.13388","n_code_links":0,"syntology":null},{"paper":"/paper/first-return-then-explore","slug":"first-return-then-explore","title":"First return, then explore","date":"2020-04-27","arxiv_id":"2004.12919","n_code_links":2,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["uber-research/go-explore"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"adaptive-stress-testing-without-domain","title":"Adaptive Stress Testing without Domain Heuristics using Go-Explore","date":"2020-04-08","arxiv_id":"2004.04292","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploration-based-language-learning-for-text-1","title":"Exploration Based Language Learning for Text-Based Games","date":"2020-01-24","arxiv_id":"2001.08868","n_code_links":0,"syntology":null},{"paper":"/paper/go-explore-a-new-approach-for-hard","slug":"go-explore-a-new-approach-for-hard","title":"Go-Explore: a New Approach for Hard-Exploration Problems","date":"2019-01-30","arxiv_id":"1901.10995","n_code_links":3,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":null}}],"papers_shown":16,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":16,"with_a_code_link":5,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":16,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/method/go-explore/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/go-explore/papers/ran/1","json":"/method/go-explore/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":8},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":7},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":5},{"task":"/task/atari-games","name":"Atari Games","papers":3},{"task":"/task/montezumas-revenge","name":"Montezuma's Revenge","papers":3},{"task":"/task/imitation-learning","name":"Imitation Learning","papers":2},{"task":"/task/continuous-control","name":"Continuous Control","papers":1},{"task":"/task/decision-making","name":"Decision Making","papers":1},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":1},{"task":"/task/diversity","name":"Diversity","papers":1},{"task":"/task/efficient-exploration","name":"Efficient Exploration","papers":1},{"task":"/task/management","name":"Management","papers":1},{"task":"/task/mathematical-reasoning","name":"Mathematical Reasoning","papers":1},{"task":"/task/mujoco","name":"MuJoCo","papers":1},{"task":"/task/multi-agent-reinforcement-learning","name":"Multi-agent Reinforcement Learning","papers":1},{"task":"/task/text-generation","name":"Text Generation","papers":1},{"task":"/task/continuous-control","name":"continuous-control","papers":1},{"task":"/task/energy-management","name":"energy management","papers":1},{"task":"/task/text-based-games","name":"text-based games","papers":1}],"tasks_shown":19,"n_tasks":19,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","papers":3},{"year":"2021","papers":1},{"year":"2022","papers":7},{"year":"2023","papers":2},{"year":"2024","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/go-explore"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Go-Explore","read_at":"2026-10-05T00:57:06+00:00","query":"Go-Explore","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"1901.10995"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"1901.10995","repositories":{"listed":3,"in_graph":3,"list_truncated":false,"strongest_link":"mentioned_in_github"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='1901.10995')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1901.10995","citations":452},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Go-Explore'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1901.10995","page":"/paper/go-explore-a-new-approach-for-hard","syntology_url":"https://syntology.ai/paper/1901.10995","in_graph_layer":true,"samples":4,"ran":2,"n_ran_checked":1,"n_instrument":1,"unverified":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 3 listed of 3 in the graph, strongest link: mentioned on GitHub. The lookup matched a paper by its title, arXiv:1901.10995, not a method entry. This answer is about arXiv:1901.10995, the paper the archive credits with this method.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"6e0a81c18bcf1cb65987867c5156177c8faa304da9d4c631e0de65ff86b8a054","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}