mlsanityData to 14 Oct 2026

Adaptive Ensemble Q-learning: Minimizing Estimation Bias via Error Feedback

arXiv 2306.11918 ↗First posted 20 Jun 2023cs.LG cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

The ensemble method is a promising way to mitigate the overestimation issue in Q-learning, where multiple function approximators are used to estimate the action values. It is known that the estimation bias hinges heavily on the ensemble size (i.e., the number of Q-function approximators used in the target), and that determining the `right' ensemble size is highly nontrivial, because of the time-varying nature of the function approximation errors during the learning process. To tackle this challenge, we first derive an upper bound and a lower bound on the estimation bias, based on which the ensemble size is adapted to drive the bias to be nearly zero, thereby coping with the impact of the time-varying approximation errors accordingly. Motivated by the theoretic findings, we advocate that the ensemble method can be combined with Model Identification Adaptive Control (MIAC) for effective ensemble size adaptation. Specifically, we devise Adaptive Ensemble Q-learning (AdaEQ), a generalized ensemble method with two key steps: (a) approximation error characterization which serves as the feedback for flexibly controlling the ensemble size, and (b) ensemble size adaptation tailored towards minimizing the estimation bias. Extensive experiments are carried out to show that AdaEQ can improve the learning performance than the existing methods for the MuJoCo benchmark.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 19 of its 53 references that are in the map. First posted on arXiv 20 Jun 2023.

Builds on

19 of 53 references.

References · 19

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  2. 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
  3. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,417
  4. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,745
  5. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
  6. 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 840
  7. 2019When to Trust Your Model: Model-Based Policy Optimizationcited by 773
  8. 2021Randomized Ensembled Double Q-Learning: Learning Fast Without a Modelcited by 288
  9. 2021How to Train Your Robot with Deep Reinforcement Learning; Lessons We've Learnedcited by 213
  10. 2018Deep Reinforcement Learning and the Deadly Triadcited by 174
  11. 2020SUNRISE: A Simple Unified Framework for Ensemble Learning in Deep Reinforcement Learningcited by 152
  12. 2019Planning with Goal-Conditioned Policiescited by 149
7 more
  1. 2020Maxmin Q-learning: Controlling the Estimation Bias of Q-learningcited by 117
  2. 2016Averaged-DQN: Variance Reduction and Stabilization for Deep Reinforcement Learningcited by 106
  3. 2016Why Deep Neural Networks for Function Approximation?cited by 82
  4. 2021On the Importance of Hyperparameter Optimization for Model-based Reinforcement Learningcited by 59
  5. 2021Ensemble Bootstrapping for Q-Learningcited by 31
  6. 2020Self-correcting Q-Learningcited by 9
  7. 2020On the Power of Randomization for Scheduling Real-Time Traffic in Wireless Networkscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 5; 2025: 2; 2026: 2.

9 papers.