AI Paper Atlas

Research map / Reinforcement learning / Visual and representation RL

Graph search and compositional goals

Plan over goal graphs or compositional goal abstractions to improve goal-conditioned RL.

55 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2019–2026) · an approach in Visual and representation RL, keyword cluster “goal · conditioned · hierarchical”

State History Tried Checklist Preprints Who Export

Where it stands

Not enough benchmark data Fewer than four papers report the same benchmark, so there is no record to follow.

15 papers in 2023–24 and 19 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic held steady, from 2.6% to 2.7%.

How this is decided

A benchmark is tracked when at least four papers of this approach report their own method on the same dataset and metric in at least two different years. Its record is the best number reported up to 2024 compared with the best reported in 2025–26: still improving means at least 1% better, flat means at most 0.2% better with at least two papers from 2025–26 trying. Numbers on a different scale from the rest (a fraction among percentages) and far outliers are left out. Results come from different papers with different setups, so they are signals, not head-to-head comparisons. The share of papers is counted at ICML, NeurIPS, ICLR, CVPR and AAAI.

How it got here

2016: 0162017: 0172018: 0182019: 1192020: 2202021: 8212022: 10222023: 9232024: 6242025: 8252026: 1126

Most cited paper of each year

Earliest papers here

What has been tried

43 papers here report 429 measured changes (a component added, removed or swapped, compared with a baseline): helped 56%, no clear effect 11%, hurt 28%, mixed 5%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
remove T-invariance losspointmaze_teleport_stitch · success rate (%)29.3(±2.2) -> 18.5(±2.1)HurtOffline Goal-conditioned Reinforcement Learning with Quasimetric Representations (NeurIPS 2025 · 2 citations)
use a 3-layer CNN instead of ResNet 18Simulated manipulation, drawer · success rate28% -> 81%HelpedStabilizing Contrastive RL: Techniques for Robotic Goal Reaching from Offline Data (ICLR 2024 · 2 citations)
add pre-training from demonstrationsVVC NMR (D0) · success rate (%)0.04±0.03 -> 45.87±3.09HelpedGoal-Conditioned On-Policy Reinforcement Learning (NeurIPS 2024 · 2 citations)
Remove variance loss from PLDMTwo-Rooms, optimal setting · success rate98.0 ± 1.5 -> 13.4 ± 9.2HurtLearning from Reward-Free Offline Data: A Case for Planning with Latent Dynamics Models (NeurIPS 2025 · 1 citation)
Add offline Q-learning (step 2) instead of using goal-conditioned behavioral cloningBabyAI Synth, train goals · success rate7 to 16HelpedThe Synergy of LLMs & RL Unlocks Offline Learning of Generalizable Language-Conditioned Policies with Low-fidelity Data (ICML 2025 · 0 citations)
Remove hindsight experience replay (HER)LTL tasks · performanceHurtAutomaton Constrained Q-Learning (NeurIPS 2025 · 0 citations)
Train SAW target subpolicy on HIQL subgoal representations instead of observationsgiant maze environments · success rateHurtFlattening Hierarchies with Policy Bootstrapping (NeurIPS 2025 · 0 citations)
Add MEGA goal selection to DRAGSuccess coverage · success coverageNo clear effectImagine Beyond ! Distributionally Robust Autoencoding for State Space Coverage in Online Reinforcement Learning (NeurIPS 2025 · 0 citations)
use n-step TD with the original γ instead of 1-step TDAntMaze-large-explore (ALE) · success rate4 {\scriptstyle ± 5} -> 0 {\scriptstyle ± 0}HurtOption-aware Temporally Abstracted Value for Offline Goal-Conditioned Reinforcement Learning (NeurIPS 2025 · 0 citations)
Train DT on 10 million transitions instead of the smaller datasetPoint maze tasks · combinatorial generalisation10 millionNo clear effectClosing the Gap between TD Learning and Supervised Learning - A Generalisation Point of View. (ICLR 2024 · 0 citations)
add test-time midpoint planning (three recursions)AntMaze and Kitchen goal-conditioned tasks · performanceMixedFoundation Policies with Hilbert Representations (ICML 2024 · 0 citations)
Train the goal-reducer with loop-removal sampling instead of trajectory samplingGeometric random graph and four-room gridworld · training lossHelpedGoal Reduction with Loop-Removal Accelerates RL and Models Human Brain Activity in Goal-Directed Learning (NeurIPS 2024 · 0 citations)

What reviewers will expect

Datasets and baselines named in the 9 papers of this approach from 2025–2026 that have a full-text summary. Leaving out the common ones is a frequent review question.

Datasets

  • OGBench pointmaze · 2 of 9 papers
  • OGBench antmaze · 2 of 9 papers
  • OGBench humanoidmaze · 2 of 9 papers
  • OGBench scene · 2 of 9 papers
  • OGBench visual-antmaze · 2 of 9 papers
  • OGBench visual-cube · 2 of 9 papers

Baselines

  • CRL · 5 of 9 papers
  • GCBC · 4 of 9 papers
  • GCIQL · 4 of 9 papers
  • GCIVL · 3 of 9 papers
  • QRL · 3 of 9 papers
  • HIQL · 3 of 9 papers

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

    Institutions on the most papers of this approach since 2023 (of 34 papers; from OpenAlex and the papers' affiliations).

    Use it

    Download BibTeX of 40 key papersOpen the topic in the interactive map

    Get alerts. Describe your idea in scime atlas and save it (free scime account): you get a weekly email when new preprints land close to it.

    Same keyword cluster

    Elsewhere in the topic

    Benchmark numbers, ablations and baseline numbers are extracted by AI from each paper's full text and can be wrong; the paper is the authority. Data: results index of 2026-11-02, citation counts from OpenAlex (2026-10-09).

    Get the next scime Dispatch and a monthly field update

    Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy