Estimation Error Correction in Deep Reinforcement Learning for Deterministic Actor-Critic Methods
Not on the map. Why?
Abstract (arXiv)
In value-based deep reinforcement learning methods, approximation of value functions induces overestimation bias and leads to suboptimal policies. We show that in deep actor-critic methods that aim to overcome the overestimation bias, if the reinforcement signals received by the agent have a high variance, a significant underestimation bias arises. To minimize the underestimation, we introduce a parameter-free, novel deep Q-learning variant. Our Q-value update rule combines the notions behind Clipped Double Q-learning and Maxmin Q-learning by computing the critic objective through the nested combination of maximum and minimum operators to bound the approximate value estimates. We evaluate our modification on the suite of several OpenAI Gym continuous control tasks, improving the state-of-the-art in every environment tested.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 14 of its 33 references that are in the map. First posted on arXiv 22 Sep 2021.
Builds on
14 of 33 references.
References · 14
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2016OpenAI Gymcited by 1,684
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
- 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
- 2016Safe and Efficient Off-Policy Reinforcement Learningcited by 260
- 2018Selective Experience Replay for Lifelong Learningcited by 239
- 2020Maxmin Q-learning: Controlling the Estimation Bias of Q-learningcited by 117
- 2016Learning to Play in a Day: Faster Deep Reinforcement Learning by Optimality Tighteningcited by 21
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1.
2 papers.