Pith sign in

REVIEW 26 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.08299 v3 pith:Y2H7JSOL submitted 2022-01-20 cs.AI cs.LG

Goal-Conditioned Reinforcement Learning: Problems and Solutions

classification cs.AI cs.LG
keywords differentgcrlgoalsproblemssolutionsagentgoal-conditionedlearning
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Goal-conditioned reinforcement learning (GCRL), related to a set of complex RL problems, trains an agent to achieve different goals under particular scenarios. Compared to the standard RL solutions that learn a policy solely depending on the states or observations, GCRL additionally requires the agent to make decisions according to different goals. In this survey, we provide a comprehensive overview of the challenges and algorithms for GCRL. Firstly, we answer what the basic problems are studied in this field. Then, we explain how goals are represented and present how existing solutions are designed from different points of view. Finally, we make the conclusion and discuss potential future prospects that recent researches focus on.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 26 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. World Models in Pieces: Structural Certification for General Agents

    cs.AI 2026-06 unverdicted novelty 7.0

    Structural certification maps bounded goal-conditioned performance to O(1/n) + O(δ) entry-wise error bounds on an agent's internal world model for transitions filtered by deep compositional goals.

  2. Learning Object Manipulation from Scratch via Contrastive Interaction

    cs.RO 2026-06 unverdicted novelty 7.0

    IWR improves CRL sample efficiency and performance in interaction-rich manipulation by interaction-aware resampling that preserves mode boundaries, yielding 19.8% average gains and a real-world air-hockey agent.

  3. Dual Advantage Fields

    cs.LG 2026-06 conditional novelty 7.0

    Dual Advantage Fields converts bilinear dual value models into local advantage scores via learned action-effect models, equaling the goal-conditioned Bellman advantage under realizability and improving aggregate metri...

  4. CurveRL: Principled Distribution-Aware Context Reweighting for LLM Reasoning

    cs.LG 2026-05 unverdicted novelty 7.0

    CurveRL derives a quantile-coordinate reweighting rule from a utility functional on pass rates and shows it outperforms GRPO on reasoning benchmarks.

  5. SpecRLBench: A Benchmark for Generalization in Specification-Guided Reinforcement Learning

    cs.LG 2026-04 unverdicted novelty 7.0

    SpecRLBench is a new benchmark evaluating generalization of LTL-guided RL methods across navigation and manipulation domains with static/dynamic environments and varied robot dynamics.

  6. Coachable agents for interactive gameplay

    cs.AI 2026-07 unverdicted novelty 6.0

    A framework combining universal value function approximators with targeted training scenarios and data augmentation produces RL agents that adapt to user-specified styles in real time across video games and humanoid d...

  7. Decoupled Behavioral Cloning for Scalable Inductive Generalization in RL from Specifications

    cs.AI 2026-05 unverdicted novelty 6.0

    DIBS decouples task policy learning via RL from evolution function learning via behavioral cloning to achieve more stable training and better generalization than prior RL and meta-RL methods for inductive generalizati...

  8. Stochastic Minimum-Cost Reach-Avoid Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 6.0

    Introduces RAPCs and a contraction Bellman operator for cost-optimal policies that satisfy probabilistic reach-avoid specifications in stochastic MDPs, with almost-sure convergence to local optima.

  9. Stochastic Minimum-Cost Reach-Avoid Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 6.0

    Introduces RAPCs and a contraction Bellman operator that jointly enforce probabilistic reach-avoid constraints while minimizing expected costs in stochastic RL, with almost-sure convergence to local optima.

  10. Plan in Sandbox, Navigate in Open Worlds: Learning Physics-Grounded Abstracted Experience for Embodied Navigation

    cs.RO 2026-05 unverdicted novelty 6.0

    SAGE trains agents in physics-grounded semantic abstractions via RL with asymmetric clipping, achieving 53.21% LLM-Match Success on A-EQA (+9.7% over baseline) and encouraging physical robot transfer.

  11. QHyer: Q-conditioned Hybrid Attention-mamba Transformer for Offline Goal-conditioned RL

    cs.LG 2026-05 unverdicted novelty 6.0

    QHyer achieves state-of-the-art results in offline goal-conditioned RL by replacing return-to-go with a state-conditioned Q-estimator and introducing a gated hybrid attention-mamba backbone for content-adaptive histor...

  12. QHyer: Q-conditioned Hybrid Attention-mamba Transformer for Offline Goal-conditioned RL

    cs.LG 2026-05 unverdicted novelty 6.0

    QHyer replaces return-to-go with a state-conditioned Q-estimator and adds a gated hybrid attention-mamba backbone to achieve state-of-the-art performance in offline goal-conditioned RL on both Markovian and non-Markov...

  13. Improving Zero-Shot Offline RL via Behavioral Task Sampling

    cs.AI 2026-04 unverdicted novelty 6.0

    Extracting task vectors from the offline dataset for policy training improves zero-shot offline RL performance by an average of 20% over random sampling baselines.

  14. When Policies Cannot Be Retrained: A Unified Closed-Form View of Post-Training Steering in Offline Reinforcement Learning

    cs.LG 2026-04 unverdicted novelty 6.0

    For diagonal-Gaussian frozen actors, PoE with alpha equals KL adaptation with beta = alpha/(1-alpha); empirically, composition shows an actor-competence ceiling with 4/5/3 HELP/FROZEN/HURT split on D4RL and zero succe...

  15. Occupancy Reward Shaping: Improving Credit Assignment for Offline Goal-Conditioned Reinforcement Learning

    cs.LG 2026-04 conditional novelty 6.0

    Occupancy Reward Shaping extracts goal-reaching rewards from world-model occupancy measures using optimal transport, improving offline goal-conditioned RL performance 2.2x on 13 tasks without changing the optimal policy.

  16. AdaTracker: Learning Adaptive In-Context Policy for Cross-Embodiment Active Visual Tracking

    cs.RO 2026-04 unverdicted novelty 6.0

    AdaTracker enables zero-shot cross-embodiment active visual tracking by encoding embodiment constraints from history to modulate a context-aware policy.

  17. DreamPolicy: A Unified World-model Policy for Scalable Humanoid Locomotion

    cs.RO 2025-05 unverdicted novelty 6.0

    DreamPolicy integrates an autoregressive diffusion world model with policy learning to produce a single scalable policy that generalizes to unseen composite terrains for humanoid locomotion.

  18. Vision-Language Foundation Models as Effective Robot Imitators

    cs.RO 2023-11 conditional novelty 6.0

    RoboFlamingo adapts open-source vision-language models for robot manipulation tasks via single-step comprehension plus an explicit policy head, outperforming prior methods on benchmarks with only light fine-tuning.

  19. FootsiesGym: A Fighting Game Benchmark for Two-Player Zero-Sum Imperfect-Information Games

    cs.AI 2026-07 accept novelty 5.0

    FootsiesGym is an open-source, vectorized fighting-game benchmark for two-player zero-sum imperfect-information RL that isolates non-transitive neutral-game dynamics while remaining tractable on standard hardware.

  20. Embodiment Shapes Rolling Behavior in a Multimodal Infant Model

    cs.RO 2026-06 unverdicted novelty 5.0

    A reinforcement learning model of a multimodal virtual infant produces rolling behaviors that reproduce age-related improvements and coordination patterns observed in human infants, shaped by changing body morphology.

  21. Goal-Conditioned Supervised Learning for LLM Fine-Tuning

    cs.LG 2026-05 unverdicted novelty 5.0

    GCSL reframes LLM fine-tuning as supervised pursuit of quality thresholds using natural-language goals, outperforming SFT and DPO on toxicity, code, and recommendation tasks.

  22. Improving Zero-Shot Offline RL via Behavioral Task Sampling

    cs.AI 2026-04 unverdicted novelty 5.0

    Extracting task vectors from offline data to define training task distributions improves zero-shot offline RL performance by an average of 20%.

  23. GCImOpt: Learning efficient goal-conditioned policies by imitating optimal trajectories

    cs.RO 2026-04 unverdicted novelty 5.0

    GCImOpt trains compact goal-conditioned neural policies by imitating efficiently generated optimal trajectories, achieving high success rates and near-optimal performance on cart-pole, quadcopter, and robot arm tasks ...

  24. Efficient Hierarchical Implicit Flow Q-learning for Offline Goal-conditioned Reinforcement Learning

    cs.LG 2026-04 unverdicted novelty 5.0

    Proposes mean flow policies and LeJEPA loss to overcome Gaussian policy limits and weak subgoal generation in hierarchical offline GCRL, reporting strong results on OGBench state and pixel tasks.

  25. Strict Subgoal Execution: Reliable Long-Horizon Planning in Hierarchical Reinforcement Learning

    cs.LG 2025-06 unverdicted novelty 5.0

    SSE improves long-horizon goal-conditioned RL by using failure and partial-success transitions to identify unreliable subgoals, streamline high-level planning, and outperform prior hierarchical methods on benchmarks.

  26. GUIDE: Goal-Initialized Directional Understanding for End-to-End Visual Navigation

    cs.RO 2026-06 unverdicted novelty 4.0

    GUIDE is an end-to-end RL policy for quadruped navigation that builds directional awareness from proprioceptive history via a spatial anchor predictor and raw depth, without ongoing goal inputs or maps.