SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2004.12919 · 2020

First return, then explore

arXiv · PDF · Open in the Atlas

Code that ran

2 of 4 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 2 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2004.12919.json · badge: /api/ran/2004.12919.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
uber-research/go-explore canonical (classifier label)
classifier basis: classifier_2025
2 ran · 2 no recorded run
FunctionStatusWhere it lives
getsize Ran
ran, honoured the contract we drafted
uber-research/go-explore/policy_based/goexplore_py/goexplore.py
pointer only (licence: NOASSERTION) · get_code("7aca6d4823baaf95")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, uber-research/go-explore (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

seed_pool_wrapper Ran
ran; our contract draft was wrong, not the code
uber-research/go-explore/robustified/goexplore_py/goexplore.py
pointer only (licence: NOASSERTION) · get_code("efd5de4203794fee")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, uber-research/go-explore (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_downscale Not yet run
unverified (harvested, no recorded run)
uber-research/go-explore/robustified/goexplore_py/goexplore.py
pointer only (licence: NOASSERTION) · get_code("c0b41660051f8848")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, uber-research/go-explore (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

run_f_seeded Not yet run
unverified (harvested, no recorded run)
uber-research/go-explore/robustified/goexplore_py/goexplore.py
pointer only (licence: NOASSERTION) · get_code("7f626c87007c22d4")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, uber-research/go-explore (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 4 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 0 the same month, 0 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
get_downscale 1 other paper
1 dated earlier
1901.10995 (2019-01)
Go-Explore: a New Approach for Hard-Exploration Problems
getsize 1 other paper
1 dated earlier
1901.10995 (2019-01)
Go-Explore: a New Approach for Hard-Exploration Problems
run_f_seeded 1 other paper
1 dated earlier
1901.10995 (2019-01)
Go-Explore: a New Approach for Hard-Exploration Problems
seed_pool_wrapper 1 other paper
1 dated earlier
1901.10995 (2019-01)
Go-Explore: a New Approach for Hard-Exploration Problems

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

The promise of reinforcement learning is to solve complex sequential decision problems autonomously by specifying a high-level reward function only. However, reinforcement learning algorithms struggle when, as is often the case, simple and intuitive rewards provide sparse and deceptive feedback. Avoiding these pitfalls requires thoroughly exploring the environment, but creating algorithms that can do so remains one of the central challenges of the field. We hypothesise that the main impediment to effective exploration originates from algorithms forgetting how to reach previously visited states ("detachment") and from failing to first return to a state before exploring from it ("derailment"). We introduce Go-Explore, a family of algorithms that addresses these two challenges directly through the simple principles of explicitly remembering promising states and first returning to such states before intentionally exploring. Go-Explore solves all heretofore unsolved Atari games and surpasses the state of the art on all hard-exploration games, with orders of magnitude improvements on the grand challenges Montezuma's Revenge and Pitfall. We also demonstrate the practical potential of Go-Explore on a sparse-reward pick-and-place robotics task. Additionally, we show that adding a goal-conditioned policy can further improve Go-Explore's exploration efficiency and enable it to handle stochasticity throughout training. The substantial performance gains from Go-Explore suggest that the simple principles of remembering states, returning to them, and exploring from them are a powerful and general approach to exploration, an insight that may prove critical to the creation of truly intelligent learning agents.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2004.12919")
get_code_for_paper("2004.12919")
have("2004.12919")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2004.12919.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2004.12919.svg)](https://syntology.ai/paper/2004.12919)

Connect an agent — have() is free.