AI Paper Atlas

Research map / Reinforcement learning / Visual and representation RL

Goal-conditioned policy learning

Train goal-reaching policies with learned goal representations, discriminative rewards, and pretraining.

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

State History Tried 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.

17 papers in 2023–24 and 13 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic shrank, from 3.0% to 1.9%.

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: 4182019: 12192020: 5202021: 8212022: 7222023: 5232024: 12242025: 6252026: 726

Most cited paper of each year

Earliest papers here

What has been tried

53 papers here report 502 measured changes (a component added, removed or swapped, compared with a baseline): helped 66%, no clear effect 10%, hurt 17%, mixed 6%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
vary the S2D transition timing across C1, C2, and C3LunarLander · performance138.71\stdv{3.71}; 63.40\stdv{160.55}; 168.88\stdv{23.66}MixedUnveiling the Significance of Toddler-Inspired Reward Transition in Goal-Oriented Reinforcement Learning (AAAI 2024 · 3 citations)
Add dual-path global and local featuresFiveK Random-Target · PSNRHelpedGoal Conditioned Reinforcement Learning for Photo Finishing Tuning (NeurIPS 2024 · 3 citations)
set the number of navigation subgoals Ns to 3 instead of 2evaluated tasks · training performanceHurtLearning World Models for Unconstrained Goal Navigation (NeurIPS 2024 · 2 citations)
Pre-train the cDFA encoder on RAD cDFAsRAD cDFAs, Letterworld · task learningHelpedCompositional Automata Embeddings for Goal-Conditioned Reinforcement Learning (NeurIPS 2024 · 1 citation)
add the final latent goal z_g as policy contextLIBERO-LONG · Avg. Success77.3 -> 83.3HelpedEfficient Robotic Policy Learning via Latent Space Backward Planning (ICML 2025 · 0 citations)
Add temporal-distance reward to FOUNDER instead of using cosine similarityDMC and Kitchen overall · normalized test performance0.52 -> 0.81HelpedFOUNDER: Grounding Foundation Models in World Models for Open-Ended Embodied Decision Making (ICML 2025 · 0 citations)
Add reached-goal history to the skill decoderMetaWorld MT50 Near-Optimal and Sub-Optimal · average episode return2952.1 (± 92.3) -> 3159.1 (± 71.0); 2041.5 (± 83.5) -> 2123.8 (± 78.1)HelpedGoal-Oriented Skill Abstraction for Offline Multi-Task Reinforcement Learning (ICML 2025 · 0 citations)
remove latent space shapingCoffee Avg. · success rate0.77 -> 0.31Hurt$\textit{Hyper-GoalNet}$: Goal-Conditioned Manipulation Policy Learning with HyperNetworks (NeurIPS 2025 · 0 citations)
add temporal difference loss L_TDMaze · Mean absolute travel-time error0.21 -> 0.08HelpedPhysics-informed Temporal Difference Metric Learning for Robot Motion Planning (ICLR 2025 · 0 citations)
Condition the policy on the time horizon rather than omit horizon conditioningOffline goal-conditioned control tasks · performanceHelpedLearning to Reach Goals via Diffusion (ICML 2024 · 0 citations)
Use a separate PCLaSt map ψ instead of applying contrastive loss directly to ACRO representation φMaze-Hallway · score89.3 ± 8.1 -> 97.8 ± 4.9HelpedPcLast: Discovering Plannable Continuous Latent States (ICML 2024 · 0 citations)
Use a maximal prompt length of 5 rather than 1MazeRunner-15, MazeRunner-30, and Kitchen · average return-2.63±0.00 -> -0.41±0.10; -27.06±0.00 -> -14.21±0.19; 0.09±0.00 -> 0.63±0.02HelpedPre-Trained Multi-Goal Transformers with Prompt Optimization for Efficient Online Adaptation (NeurIPS 2024 · 0 citations)

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

    Institutions on the most papers of this approach since 2023 (of 30 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