Diversify & Conquer: Outcome-directed Curriculum RL via Out-of-Distribution Disagreement
Not on the map. Why?
Abstract (arXiv)
Reinforcement learning (RL) often faces the challenges of uninformed search problems where the agent should explore without access to the domain knowledge such as characteristics of the environment or external rewards. To tackle these challenges, this work proposes a new approach for curriculum RL called Diversify for Disagreement & Conquer (D2C). Unlike previous curriculum learning methods, D2C requires only a few examples of desired outcomes and works in any environment, regardless of its geometry or the distribution of the desired outcome examples. The proposed method performs diversification of the goal-conditional classifiers to identify similarities between visited and desired outcome states and ensures that the classifiers disagree on states from out-of-distribution, which enables quantifying the unexplored region and designing an arbitrary goal-conditioned intrinsic reward signal in a simple and intuitive way. The proposed method then employs bipartite matching to define a curriculum learning objective that produces a sequence of well-adjusted intermediate goals, which enable the agent to automatically explore and conquer the unexplored region. We present experimental results demonstrating that D2C outperforms prior curriculum RL methods in both quantitative and qualitative aspects, even with the arbitrarily distributed desired outcome examples.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 43 of its 49 references that are in the map. First posted on arXiv 30 Oct 2023.
Builds on
43 of 49 references.
References · 43
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2017Deep reinforcement learning from human preferencescited by 3,846
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,304
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
- 2019Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learningcited by 1,168
- 2017Hindsight Experience Replaycited by 1,096
- 2018Exploration by Random Network Distillationcited by 966
- 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 734
31 more
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
- 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 522
- 2019Dynamics-Aware Unsupervised Discovery of Skillscited by 308
- 2021PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-trainingcited by 298
- 2019Self-Supervised Exploration via Disagreementcited by 263
- 2017Count-Based Exploration with Neural Density Modelscited by 255
- 2017Automatic Goal Generation for Reinforcement Learning Agentscited by 252
- 2020Prioritized Level Replaycited by 190
- 2021Reinforcement Learning with Prototypical Representationscited by 179
- 2021Behavior From the Void: Unsupervised Active Pre-Trainingcited by 173
- 2019Skew-Fit: State-Covering Self-Supervised Reinforcement Learningcited by 171
- 2016Correlation Alignment for Unsupervised Domain Adaptationcited by 146
- 2017Intrinsic Motivation and Automatic Curricula via Asymmetric Self-Playcited by 139
- 2021Discovering and Achieving Goals via World Modelscited by 131
- 2019End-to-End Robotic Reinforcement Learning without Reward Engineeringcited by 115
- 2019Teacher algorithms for curriculum learning of Deep RL in continuously parameterized environmentscited by 113
- 2021APS: Active Pretraining with Successor Featurescited by 109
- 2018Unsupervised Control Through Non-Parametric Discriminative Rewardscited by 102
- 2020Automatic Curriculum Learning through Value Disagreementcited by 86
- 2022Agree to Disagree: Diversity through Disagreement for Better Transferabilitycited by 69
- 2018Variational Inverse Control with Events: A General Framework for Data-Driven Reward Definitioncited by 66
- 2022CIC: Contrastive Intrinsic Control for Unsupervised Skill Discoverycited by 66
- 2022Diversify and Disambiguate: Learning From Underspecified Datacited by 55
- 2019Exploration via Hindsight Goal Generationcited by 53
- 2021Replacing Rewards with Examples: Example-Based Policy Search via Recursive Classificationcited by 38
- 2022Choreographer: Learning and Adapting Skills in Imaginationcited by 31
- 2021Unsupervised Skill Discovery with Bottleneck Option Learningcited by 28
- 2023Planning Goals for Explorationcited by 28
- 2021MURAL: Meta-Learning Uncertainty-Aware Rewards for Outcome-Driven Reinforcement Learningcited by 24
- 2021Mutual Information State Intrinsic Controlcited by 18
- 2023Outcome-directed Reinforcement Learning by Uncertainty & Temporal Distance-Aware Curriculum Goal Generationcited by 14
Built on by
Citing papers per year: 2025: 4.
4 papers.
- 2025DISCOVER: Automated Curricula for Sparse-Reward Reinforcement Learningcited by 11
- 2025Diversify and Conquer: Open-set Disagreement for Robust Semi-supervised Learning with Outlierscited by 1
- 2025Causal-Paced Deep Reinforcement Learningcited by 1
- 2025Periodic Skill Discoverycited by 1
- 2025Periodic Skill Discovery5 Nov 2025
- 2025Causal-Paced Deep Reinforcement Learning24 Jun 2025
- 2025Diversify and Conquer: Open-set Disagreement for Robust Semi-supervised Learning with Outliers30 May 2025
- 2025DISCOVER: Automated Curricula for Sparse-Reward Reinforcement Learning26 May 2025