Generating Automatic Curricula via Self-Supervised Active Domain Randomization
Not on the map. Why?
Abstract (arXiv)
Goal-directed Reinforcement Learning (RL) traditionally considers an agent interacting with an environment, prescribing a real-valued reward to an agent proportional to the completion of some goal. Goal-directed RL has seen large gains in sample efficiency, due to the ease of reusing or generating new experience by proposing goals. One approach,self-play, allows an agent to "play" against itself by alternatively setting and accomplishing goals, creating a learned curriculum through which an agent can learn to accomplish progressively more difficult goals. However, self-play has been limited to goal curriculum learning or learning progressively harder goals within a single environment. Recent work on robotic agents has shown that varying the environment during training, for example with domain randomization, leads to more robust transfer. As a result, we extend the self-play framework to jointly learn a goal and environment curriculum, leading to an approach that learns the most fruitful domain randomization strategy with self-play. Our method, Self-Supervised Active Domain Randomization(SS-ADR), generates a coupled goal-task curriculum, where agents learn through progressively more difficult tasks and environment variations. By encouraging the agent to try tasks that are just outside of its current capabilities, SS-ADR builds a domain randomization curriculum that enables state-of-the-art results on varioussim2real transfer tasks. Our results show that a curriculum of co-evolving the environment difficulty together with the difficulty of goals set in each environment provides practical benefits in the goal-directed tasks tested.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 0; 2024: 1; 2025: 1.
7 papers.
- 2024Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Promptscited by 205
- 2022Evolving Curricula with Regret-Based Environment Designcited by 173
- 2021RobustNav: Towards Benchmarking Robustness in Embodied Navigationcited by 54
- 2022Environment Generation for Zero-Shot Compositional Reinforcement Learningcited by 32
- 2021Efficient Scheduling of Data Augmentation for Deep Reinforcement Learningcited by 3
- 2025Robust Agents in Open-Ended Worldscited by 1
- 2022Efficient Scheduling of Data Augmentation for Deep Reinforcement Learningcited by 0
- 2025Robust Agents in Open-Ended Worlds9 Dec 2025
- 2024Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Prompts26 Feb 2024
- 2022Efficient Scheduling of Data Augmentation for Deep Reinforcement Learning1 Jun 2022
- 2022Evolving Curricula with Regret-Based Environment Design2 Mar 2022
- 2022Environment Generation for Zero-Shot Compositional Reinforcement Learning21 Jan 2022
- 2021RobustNav: Towards Benchmarking Robustness in Embodied Navigation8 Jun 2021
- 2021Efficient Scheduling of Data Augmentation for Deep Reinforcement Learning17 Feb 2021