mlsanityData to 7 Oct 2026

Decoupled Exploration and Exploitation Policies for Sample-Efficient Reinforcement Learning

arXiv 2101.09458 ↗First posted 23 Jan 2021cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

Despite the close connection between exploration and sample efficiency, most state of the art reinforcement learning algorithms include no considerations for exploration beyond maximizing the entropy of the policy. In this work we address this seeming missed opportunity. We observe that the most common formulation of directed exploration in deep RL, known as bonus-based exploration (BBE), suffers from bias and slow coverage in the few-sample regime. This causes BBE to be actively detrimental to policy learning in many control tasks. We show that by decoupling the task policy from the exploration policy, directed exploration can be highly effective for sample-efficient continuous control. Our method, Decoupled Exploration and Exploitation Policies (DEEP), can be combined with any off-policy RL algorithm without modification. When used in conjunction with soft actor-critic, DEEP incurs no performance penalty in densely-rewarding environments. On sparse environments, DEEP gives a several-fold improvement in data efficiency due to better exploration.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 29 of its 51 references that are in the map. First posted on arXiv 23 Jan 2021.

Builds on

29 of 51 references.

References · 29

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  4. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  5. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
  6. 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
  7. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  8. 2015Prioritized Experience Replaycited by 1,070
  9. 2018Exploration by Random Network Distillationcited by 966
  10. 2018DeepMind Control Suitecited by 935
  11. 2018QT-Opt: Scalable Deep Reinforcement Learning for Vision-Based Robotic Manipulationcited by 730
  12. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
17 more
  1. 2016Deep Exploration via Bootstrapped DQNcited by 518
  2. 2018Is Q-learning Provably Efficient?cited by 485
  3. 2018Maximum a Posteriori Policy Optimisationcited by 318
  4. 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
  5. 2017Noisy Networks for Explorationcited by 262
  6. 2017Count-Based Exploration with Neural Density Modelscited by 255
  7. 2020Never Give Up: Learning Directed Exploration Strategiescited by 210
  8. 2018Learning by Playing - Solving Sparse Reward Tasks from Scratchcited by 164
  9. 2017Parameter Space Noise for Explorationcited by 158
  10. 2017Deep Exploration via Randomized Value Functionscited by 155
  11. 2015Incentivizing Exploration In Reinforcement Learning With Deep Predictive Modelscited by 154
  12. 2018Count-Based Exploration with the Successor Representationcited by 112
  13. 2020Kernel Operations on the GPU, with Autodiff, without Memory Overflowscited by 101
  14. 2017Data-efficient Deep Reinforcement Learning for Dexterous Manipulationcited by 61
  15. 2020Continuous-Discrete Reinforcement Learning for Hybrid Control in Roboticscited by 42
  16. 2019Dynamics-aware Embeddingscited by 34
  17. 2020Optimistic Exploration even with a Pessimistic Initialisationcited by 25

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 4; 2023: 4; 2024: 2; 2025: 3.

14 papers.

Sort:

By area: