Curriculum Reinforcement Learning via Constrained Optimal Transport
Pascal Klink, Haoyi Yang, Carlo D'Eramo, Jan Peters, Joni Pajarinen
Abstract
Curriculum reinforcement learning (CRL) allows solving complex tasks by generating a tailored sequence of learning tasks, starting from easy ones and subsequently increasing their difficulty. Although the potential of curricula in RL has been clearly shown in a variety of works, it is less clear how to generate them for a given learning environment, resulting in a variety of methods aiming to automate this task. In this work, we focus on the idea of framing curricula as interpolations between task distributions, which has previously been shown to be a viable approach to CRL. Identifying key issues of existing methods, we frame the generation of a curriculum as a constrained optimal transport problem between task distributions. Benchmarks show that this way of curriculum generation can improve upon existing CRL methods, yielding high performance in a variety of tasks with different characteristics.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 805979f2-3599-4473-9c39-378ccb2dccafCited by top-tier papers21
- Curriculum Reinforcement Learning using Optimal Transport via Gradual Domain AdaptationPeide Huang, Mengdi Xu, Jiacheng Zhu, Laixi Shi et al.NeurIPS 2022 · 44 citations
- Accelerating Motion Planning via Optimal TransportAn T. Le, Georgia Chalvatzaki, Armin Biess, Jan PetersNeurIPS 2023 · 30 citations
- Domain Randomization via Entropy MaximizationGabriele Tiboni, Pascal Klink, Jan Peters, Tatiana Tommasi et al.ICLR 2024 · 24 citations
- Acquiring Diverse Skills using Curriculum Reinforcement Learning with Mixture of ExpertsOnur Celik, Aleksandar Taranovic, Gerhard NeumannICML 2024 · 19 citations
- CQM: Curriculum Reinforcement Learning with a Quantized World ModelSeungjae Lee, Daesol Cho, Jonghae Park, H. Jin KimNeurIPS 2023 · 18 citations
Builds on12
- Emergent Complexity and Zero-shot Transfer via Unsupervised Environment DesignMichael Dennis, Natasha Jaques, Eugene Vinitsky, Alexandre M. Bayen et al.NeurIPS 2020 · 362 citations
- Prioritized Level ReplayMinqi Jiang, Edward Grefenstette, Tim RocktäschelICML 2021 · 211 citations
- Count-Based Exploration with the Successor RepresentationMarlos C. Machado, Marc G. Bellemare, Michael BowlingAAAI 2020 · 206 citations
- Replay-Guided Adversarial Environment DesignMinqi Jiang, Michael Dennis, Jack Parker-Holder, Jakob N. Foerster et al.NeurIPS 2021 · 148 citations
- When Do Curricula Work?Xiaoxia Wu, Ethan Dyer, Behnam NeyshaburICLR 2021 · 141 citations
Related papers
- Self-Paced Deep Reinforcement LearningPascal Klink, Carlo D'Eramo, Jan Peters, Joni PajarinenNeurIPS 2020 · 83 citations
- Safety-Prioritizing Curricula for Constrained Reinforcement LearningCevahir Köprülü, Thiago D. Simão, Nils Jansen, Ufuk TopcuICLR 2025
- Automated curriculum generation through setter-solver interactionsSébastien Racanière, Andrew K. Lampinen, Adam Santoro, David P. Reichert et al.ICLR 2020 · 41 citations
- PORTAL: Automatic Curricula Generation for Multiagent Reinforcement LearningJizhou Wu, Jianye Hao, Tianpei Yang, Xiaotian Hao et al.AAAI 2024 · 12 citations
- Adaptive Procedural Task Generation for Hard-Exploration ProblemsKuan Fang, Yuke Zhu, Silvio Savarese, Li Fei-FeiICLR 2021 · 36 citations
