Cited by 612Reinforcement Learning in RoboticsArtificial Intelligence in GamesAdvanced Bandit Algorithms Research

Distributional Reinforcement Learning With Quantile Regression

Open access
Dabney, Will, Rowland, Mark, Bellemare, Marc, Munos, Rémi·2018·Proceedings of the AAAI Conference on Artificial Intelligence

Abstract

In reinforcement learning (RL), an agent interacts with the environment by taking actions and observing the next state and reward. When sampled probabilistically, these state transitions, rewards, and actions can all induce randomness in the observed long-term return. Traditionally, reinforcement learning algorithms average over this randomness to estimate the value function. In this paper, we build on recent work advocating a distributional approach to reinforcement learning in which the distribution over returns is modeled explicitly instead of only estimating the mean. That is, we examine methods of learning the value distribution instead of the value function. We give results that close a number of gaps between the theoretical and algorithmic results given by Bellemare, Dabney, and Munos (2017). First, we extend existing results to the approximate distribution setting. Second, we present a novel distributional reinforcement learning algorithm consistent with our theoretical formulation. Finally, we evaluate this new algorithm on the Atari 2600 games, observing that it significantly outperforms many of the recent improvements on DQN, including the related distributional algorithm C51.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1609/aaai.v32i1.11791

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Dreamer outperforms Rainbow and IQN on Atari.

    “Dreamer also outperforms the widely used expert algorithms Rainbow36 and IQN37.”

    From Mastering diverse control tasks through world models (2025) · cites this paper as [37]

    The Evaluation on Atari 2600 (pp. 6–7) compares QR-DQN with earlier agents, not Dreamer with Rainbow or IQN. Searches for Dreamer, Rainbow, and IQN found no passage in our copy addressing the claimed comparison. (LLM, conf=0.76)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 24

  1. Aravkin, A. Y.; Kambadur, A.; Lozano, A. C.; and Luss, R. 2014. Sparse Quantile Huber Regression for Efficient and Robust Estimation. arXiv .
  2. Arjovsky, M.; Chintala, S.; and Bottou, L. 2017. Wasserstein Generative Adversarial Networks. In Proceedings of the 34th International Conference on Machine Learning (ICML) .
  3. Bellemare, M. G.; Danihelka, I.; Dabney, W.; Mohamed, S.; Lakshminarayanan, B.; Hoyer, S.; and Munos, R. 2017. The Cramer Distance as a Solution to Biased Wasserstein Gradients. arXiv .
  4. Bellemare, M. G.; Dabney, W.; and Munos, R. 2017. A Distributional Perspective on Reinforcement Learning. Proceedings of the 34th International Conference on Machine Learning (ICML) .
  5. Bickel, P. J., and Freedman, D. A. 1981. Some Asymptotic Theory for the Bootstrap. The Annals of Statistics 11961217.
  6. Chow, Y.; Tamar, A.; Mannor, S.; and Pavone, M. 2015. Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approach. In Advances in Neural Information Processing Systems (NIPS) , 1522-1530.
  7. Dearden, R.; Friedman, N.; and Russell, S. 1998. Bayesian Q-learning. In Proceedings of the National Conference on Artificial Intelligence .
  8. Engel, Y.; Mannor, S.; and Meir, R. 2005. Reinforcement Learning with Gaussian Processes. In Proceedings of the International Conference on Machine Learning (ICML) .
  9. Goldstein, S.; Misra, B.; and Courtage, M. 1981. On Intrinsic Randomness of Dynamical Systems. Journal of Statistical Physics 25(1):111-126.
  10. Heger, M. 1994. Consideration of Risk in Reinforcement Learning. In Proceedings of the 11th International Conference on Machine Learning , 105-111.
  11. Huber, P. J. 1964. Robust Estimation of a Location Parameter. The Annals of Mathematical Statistics 35(1):73-101.
  12. Koenker, R., and Hallock, K. 2001. Quantile Regression: An Introduction. Journal of Economic Perspectives 15(4):4356.
  13. Koenker, R. 2005. Quantile Regression . Cambridge University Press.
  14. Levina, E., and Bickel, P. 2001. The Earth Mover's Distance is the Mallows Distance: Some Insights from Statistics. In The 8th IEEE International Conference on Computer Vision (ICCV) . IEEE.
  15. Mnih, V.; Kavukcuoglu, K.; Silver, D.; Rusu, A. A.; Veness, J.; Bellemare, M. G.; Graves, A.; Riedmiller, M.; Fidjeland, A. K.; Ostrovski, G.; et al. 2015. Human-level Control through Deep Reinforcement Learning. Nature 518(7540):529-533.
  16. Morimura, T.; Hachiya, H.; Sugiyama, M.; Tanaka, T.; and Kashima, H. 2010. Parametric Return Density Estimation for Reinforcement Learning. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI) .
  17. M¨ uller, A. 1997. Integral Probability Metrics and their Generating Classes of Functions. Advances in Applied Probability 29(2):429-443.
  18. Nair, A.; Srinivasan, P.; Blackwell, S.; Alcicek, C.; Fearon, R.; De Maria, A.; Panneershelvam, V.; Suleyman, M.; Beattie, C.; and Petersen, S. e. a. 2015. Massively Parallel Methods for Deep Reinforcement Learning. In ICML Workshop on Deep Learning .
  19. Rummery, G. A., and Niranjan, M. 1994. On-line Qlearning using Connectionist Systems. Technical report, Cambridge University Engineering Department.
  20. Schaul, T.; Quan, J.; Antonoglou, I.; and Silver, D. 2016. Prioritized Experience Replay. In Proceedings of the International Conference on Learning Representations (ICLR) .
  21. Taylor, J. W. 1999. A Quantile Regression Approach to Estimating the Distribution of Multiperiod Returns. The Journal of Derivatives 7(1):64-78.
  22. Tsitsiklis, J. N., and Van Roy, B. 1997. An Analysis of Temporal-Difference Learning with Function Approximation. IEEE Transactions on Automatic Control 42(5):674690.
  23. Wang, Z.; Schaul, T.; Hessel, M.; Hasselt, H. v.; Lanctot, M.; and de Freitas, N. 2016. Dueling Network Architectures for Deep Reinforcement Learning. In Proceedings of the International Conference on Machine Learning (ICML) .
  24. Watkins, C. J., and Dayan, P. 1992. Q-learning. Machine Learning 8(3):279-292.

Cited by

Sorted by citations

Authors
Dabney, W., Rowland, M., Bellemare, M., & Munos, R.
Affiliations
  • Google DeepMind (United Kingdom) (GB)
  • University of Cambridge (GB)
  • Google (United States) (US)
Venue
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2018-04-29
Volume
32
Issue
1
ISSN
  • 2159-5399 (ISSN-L)
  • 2374-3468
OpenAlex
W2765302304
Cited by
612
References
6
Citations by year
2026: 91 · 2025: 106 · 2024: 99 · 2023: 100 · 2022: 78 · 2021: 54 · 2020: 50 · 2019: 26 · 2018: 8
FWCI
13.91
Type
conference paper
Language
en
Open access
Locations
  • Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
  • AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) (submittedVersion)
Funders
DeepMind
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
Keywords
distributional reinforcement learning, quantile regression, approximate distribution, Atari 2600, deep Q-network, long-term returns

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review