ADER:Adapting between Exploration and Robustness for Actor-Critic Methods
Not on the map. Why?
Abstract (arXiv)
Combining off-policy reinforcement learning methods with function approximators such as neural networks has been found to lead to overestimation of the value function and sub-optimal solutions. Improvement such as TD3 has been proposed to address this issue. However, we surprisingly find that its performance lags behind the vanilla actor-critic methods (such as DDPG) in some primitive environments. In this paper, we show that the failure of some cases can be attributed to insufficient exploration. We reveal the culprit of insufficient exploration in TD3, and propose a novel algorithm toward this problem that ADapts between Exploration and Robustness, namely ADER. To enhance the exploration ability while eliminating the overestimation bias, we introduce a dynamic penalty term in value estimation calculated from estimated uncertainty, which takes into account different compositions of the uncertainty in different learning stages. Experiments in several challenging environments demonstrate the supremacy of the proposed method in continuous control tasks.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 16 of its 30 references that are in the map. First posted on arXiv 8 Sep 2021.
Builds on
16 of 30 references.
References · 16
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
- 2016Deep Exploration via Bootstrapped DQNcited by 518
- 2018Implicit Quantile Networks for Distributional Reinforcement Learningcited by 362
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
4 more
- 2020Agent57: Outperforming the Atari Human Benchmarkcited by 300
- 2019Better Exploration with Optimistic Actor-Criticcited by 88
- 2019Distributional Reinforcement Learning for Efficient Explorationcited by 59
- 2017Efficient exploration with Double Uncertain Value Networkscited by 15
Built on by
Citing papers per year: 2022: 1.
1 paper.