ADDQ: Adaptive Distributional Double Q-Learning

Leif Döring, Benedikt Wille, Maximilian Birr, Mihail Bîrsan, Martin Slowik
2/14/2026

No official code found. Best implementation: BommeHD/ADDQ (1 star, MIT, last commit 2025-05-22).

Abstract

Bias problems in the estimation of $Q$-values are a well-known obstacle that slows down convergence of $Q$-learning and actor-critic methods. One of the reasons of the success of modern RL algorithms is partially a direct or indirect overestimation reduction mechanism. We propose an easy to implement method built on top of distributional reinforcement learning (DRL) algorithms to deal with the overestimation in a locally adaptive way. Our framework is simple to implement, existing distributional algorithms can be improved with a few lines of code. We provide theoretical evidence and use double $Q$-learning to show how to include locally adaptive overestimation control in existing algorithms. Experiments are provided for tabular, Atari, and MuJoCo environments.

View on arXivView PDF

Code Implementations(1)

BommeHD/ADDQCommunity100%
MIT
10Shell, PythonApr 1, 20251 years agoMIT

Similar Papers

Cite this paper

@article{dring2026addq,
  title  = {ADDQ: Adaptive Distributional Double Q-Learning},
  author = {Leif Döring and Benedikt Wille and Maximilian Birr and Mihail Bîrsan and Martin Slowik},
  year   = {2026},
  eprint = {2506.19478},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2506.19478},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.19478.svg)](https://codeofpaper.com/paper/2506.19478)

Discussion