Rainbow: Combining Improvements in Deep Reinforcement Learning
Matteo Hessel, Joseph Modayil, Hado van Hasselt, Tom Schaul, Georg, Ostrovski, Will Dabney, Dan Horgan, Bilal Piot, Mohammad Azar, David Silver

TL;DR
This paper investigates the combination of six improvements to the DQN algorithm in deep reinforcement learning, demonstrating that their integration achieves state-of-the-art results on Atari 2600 benchmarks.
Contribution
It systematically studies the complementarity of multiple DQN enhancements and empirically demonstrates their combined effectiveness in improving performance.
Findings
Achieves state-of-the-art Atari 2600 performance
Shows the combined approach improves data efficiency
Provides ablation analysis of each component's contribution
Abstract
The deep reinforcement learning community has made several independent improvements to the DQN algorithm. However, it is unclear which of these extensions are complementary and can be fruitfully combined. This paper examines six extensions to the DQN algorithm and empirically studies their combination. Our experiments show that the combination provides state-of-the-art performance on the Atari 2600 benchmark, both in terms of data efficiency and final performance. We also provide results from a detailed ablation study that shows the contribution of each component to overall performance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Algorithms and Applications · Reinforcement Learning in Robotics
MethodsAdam · Double Q-learning · Prioritized Experience Replay · Noisy Linear Layer · Dueling Network · N-step Returns · Rainbow DQN · Q-Learning · Dense Connections · Convolution
