mlsanityData to 7 Oct 2026

Value Activation for Bias Alleviation: Generalized-activated Deep Double Deterministic Policy Gradients

arXiv 2112.11216 ↗First posted 21 Dec 2021cs.LG cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

It is vital to accurately estimate the value function in Deep Reinforcement Learning (DRL) such that the agent could execute proper actions instead of suboptimal ones. However, existing actor-critic methods suffer more or less from underestimation bias or overestimation bias, which negatively affect their performance. In this paper, we reveal a simple but effective principle: proper value correction benefits bias alleviation, where we propose the generalized-activated weighting operator that uses any non-decreasing function, namely activation function, as weights for better value estimation. Particularly, we integrate the generalized-activated weighting operator into value estimation and introduce a novel algorithm, Generalized-activated Deep Double Deterministic Policy Gradients (GD3). We theoretically show that GD3 is capable of alleviating the potential estimation bias. We interestingly find that simple activation functions lead to satisfying performance with no additional tricks, and could contribute to faster convergence. Experimental results on numerous challenging continuous control tasks show that GD3 with task-specific activation outperforms the common baseline methods. We also uncover a fact that fine-tuning the polynomial activation function achieves superior results on most of the tasks.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 26 of its 49 references that are in the map. First posted on arXiv 21 Dec 2021.

Builds on

26 of 49 references.

References · 26

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  2. 2015Continuous control with deep reinforcement learningcited by 3,279
  3. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  4. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
  5. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  6. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
  7. 2017A Distributional Perspective on Reinforcement Learningcited by 743
  8. 2017Reinforcement Learning with Deep Energy-Based Policiescited by 659
  9. 2018Distributed Prioritized Experience Replaycited by 260
  10. 2018Distributed Distributional Deterministic Policy Gradientscited by 195
  11. 2020Controlling Overestimation Bias with Truncated Mixture of Continuous Distributional Quantile Criticscited by 154
  12. 2019Mastering Complex Control in MOBA Games with Deep Reinforcement Learningcited by 150
14 more
  1. 2016Continuous Deep Q-Learning with Model-based Accelerationcited by 149
  2. 2019Better Exploration with Optimistic Actor-Criticcited by 88
  3. 2020Chip Placement with Deep Reinforcement Learningcited by 83
  4. 2020Towards Playing Full MOBA Games with Deep Reinforcement Learningcited by 78
  5. 2021Believe What You See: Implicit Constraint Approach for Offline Multi-Agent Reinforcement Learningcited by 78
  6. 2017Data-efficient Deep Reinforcement Learning for Dexterous Manipulationcited by 61
  7. 2021Tactical Optimism and Pessimism for Deep Reinforcement Learningcited by 55
  8. 2019AlphaStar: An Evolutionary Computation Perspectivecited by 50
  9. 2021Offline Decentralized Multi-Agent Reinforcement Learningcited by 32
  10. 2020Softmax Deep Double Deterministic Policy Gradientscited by 31
  11. 2019Adaptive Power System Emergency Control using Deep Reinforcement Learningcited by 26
  12. 2021Efficient Continuous Control with Double Actors and Regularized Criticscited by 20
  13. 2020The Effect of Multi-step Methods on Overestimation in Deep Reinforcement Learningcited by 14
  14. 2020DSAC: Distributional Soft Actor-Critic for Risk-Sensitive Reinforcement Learningcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 2.

6 papers.