CIM: Constrained Intrinsic Motivation for Sparse-Reward Continuous Control
Not on the map. Why?
Abstract (arXiv)
Intrinsic motivation is a promising exploration technique for solving reinforcement learning tasks with sparse or absent extrinsic rewards. There exist two technical challenges in implementing intrinsic motivation: 1) how to design a proper intrinsic objective to facilitate efficient exploration; and 2) how to combine the intrinsic objective with the extrinsic objective to help find better solutions. In the current literature, the intrinsic objectives are all designed in a task-agnostic manner and combined with the extrinsic objective via simple addition (or used by itself for reward-free pre-training). In this work, we show that these designs would fail in typical sparse-reward continuous control tasks. To address the problem, we propose Constrained Intrinsic Motivation (CIM) to leverage readily attainable task priors to construct a constrained intrinsic objective, and at the same time, exploit the Lagrangian method to adaptively balance the intrinsic and extrinsic objectives via a simultaneous-maximization framework. We empirically show, on multiple sparse-reward continuous control tasks, that our CIM approach achieves greatly improved performance and sample efficiency over state-of-the-art methods. Moreover, the key techniques of our CIM can also be plugged into existing methods to boost their performances.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 47 of its 67 references that are in the map. First posted on arXiv 28 Nov 2022.
Builds on
47 of 67 references.
References · 47
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2018Exploration by Random Network Distillationcited by 966
- 2020CURL: Contrastive Unsupervised Representations for Reinforcement Learningcited by 745
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
- 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 514
- 2019Dynamics-Aware Unsupervised Discovery of Skillscited by 308
- 2016Contextual Decision Processes with Low Bellman Rank are PAC-Learnablecited by 290
- 2020First return, then explorecited by 256
- 2018Provably Efficient Maximum Entropy Explorationcited by 240
- 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
- 2020FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPscited by 232
- 2020Never Give Up: Learning Directed Exploration Strategiescited by 210
35 more
- 2021Behavior From the Void: Unsupervised Active Pre-Trainingcited by 173
- 2018Learning by Playing - Solving Sparse Reward Tasks from Scratchcited by 164
- 2017Parameter Space Noise for Explorationcited by 158
- 2020SUNRISE: A Simple Unified Framework for Ensemble Learning in Deep Reinforcement Learningcited by 150
- 2021Tianshou: a Highly Modularized Deep Reinforcement Learning Librarycited by 139
- 2021URLB: Unsupervised Reinforcement Learning Benchmarkcited by 138
- 2020RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated Environmentscited by 135
- 2019Fast Task Inference with Variational Intrinsic Successor Featurescited by 131
- 2021Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraintscited by 124
- 2016Why is Posterior Sampling Better than Optimism for Reinforcement Learning?cited by 116
- 2021APS: Active Pretraining with Successor Featurescited by 109
- 2021State Entropy Maximization with Random Encoders for Efficient Explorationcited by 107
- 2020PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learningcited by 91
- 2020Learning with AMIGo: Adversarially Motivated Intrinsic Goalscited by 86
- 2018Diversity-Driven Exploration Strategy for Deep Reinforcement Learningcited by 65
- 2021Hierarchical Reinforcement Learning By Discovering Intrinsic Optionscited by 57
- 2021Cautiously Optimistic Policy Optimization and Exploration with Linear Function Approximationcited by 53
- 2022Efficient Reinforcement Learning in Block MDPs: A Model-free Representation Learning Approachcited by 51
- 2019Sub-policy Adaptation for Hierarchical Reinforcement Learningcited by 47
- 2021Adversarially Guided Actor-Criticcited by 47
- 2017EX2: Exploration with Exemplar Models for Deep Reinforcement Learningcited by 42
- 2020Nearly Minimax Optimal Reinforcement Learning for Discounted MDPscited by 42
- 2021MADE: Exploration via Maximizing Deviation from Explored Regionscited by 40
- 2021Hierarchical Skills for Efficient Explorationcited by 37
- 2020Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample Complexitycited by 28
- 2020Novelty Search in Representational Space for Sample Efficient Explorationcited by 26
- 2021Principled Exploration via Optimistic Bootstrapping and Backward Inductioncited by 26
- 2021Dynamic Bottleneck for Robust Self-Supervised Explorationcited by 21
- 2021Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selectioncited by 17
- 2021Provably Correct Optimization and Exploration with Non-linear Policiescited by 13
- 2021Wish you were here: Hindsight Goal Selection for long-horizon dexterous manipulationcited by 13
- 2021Going Beyond Linear RL: Sample Efficient Neural Function Approximationcited by 9
- 2021Hindsight Task Relabelling: Experience Replay for Sparse Reward Meta-RLcited by 8
- 2017The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimalcited by 4
- 2021HAC Explore: Accelerating Exploration with Hierarchical Reinforcement Learningcited by 3
Built on by
Citing papers per year: 2023: 1.
1 paper.