mlsanityData to 7 Oct 2026

GDI: Rethinking What Makes Reinforcement Learning Different From Supervised Learning

arXiv 2106.06232 ↗First posted 11 Jun 2021cs.LG cs.AI cs.NEcited by 7

Not on the map. Why?

Abstract (arXiv)

Deep Q Network (DQN) firstly kicked the door of deep reinforcement learning (DRL) via combining deep learning (DL) with reinforcement learning (RL), which has noticed that the distribution of the acquired data would change during the training process. DQN found this property might cause instability for training, so it proposed effective methods to handle the downside of the property. Instead of focusing on the unfavourable aspects, we find it critical for RL to ease the gap between the estimated data distribution and the ground truth data distribution while supervised learning (SL) fails to do so. From this new perspective, we extend the basic paradigm of RL called the Generalized Policy Iteration (GPI) into a more generalized version, which is called the Generalized Data Distribution Iteration (GDI). We see massive RL algorithms and techniques can be unified into the GDI paradigm, which can be considered as one of the special cases of GDI. We provide theoretical proof of why GDI is better than GPI and how it works. Several practical algorithms based on GDI have been proposed to verify the effectiveness and extensiveness of it. Empirical experiments prove our state-of-the-art (SOTA) performance on Arcade Learning Environment (ALE), wherein our algorithm has achieved 9620.98% mean human normalized score (HNS), 1146.39% median HNS and 22 human world record breakthroughs (HWRB) using only 200M training frames. Our work aims to lead the RL research to step into the journey of conquering the human world records and seek real superhuman agents on both performance and efficiency.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 25 of its 61 references that are in the map. First posted on arXiv 11 Jun 2021.

Builds on

25 of 61 references.

References · 25

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  2. 2015Trust Region Policy Optimizationcited by 2,503
  3. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
  4. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
  5. 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,327
  6. 2019Dota 2 with Large Scale Deep Reinforcement Learningcited by 1,084
  7. 2015Prioritized Experience Replaycited by 1,070
  8. 2020Mastering Atari with Discrete World Modelscited by 990
  9. 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
  10. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
  11. 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
  12. 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 734
13 more
  1. 2019Model-Based Reinforcement Learning for Ataricited by 495
  2. 2017Population Based Training of Neural Networkscited by 351
  3. 2020Agent57: Outperforming the Atari Human Benchmarkcited by 300
  4. 2016Safe and Efficient Off-Policy Reinforcement Learningcited by 260
  5. 2019Go-Explore: a New Approach for Hard-Exploration Problemscited by 207
  6. 2017Equivalence Between Policy Gradients and Soft Q-Learningcited by 172
  7. 2020Effective Diversity in Population Based Reinforcement Learningcited by 116
  8. 2020DisCor: Corrective Feedback in Reinforcement Learning via Distribution Correctioncited by 71
  9. 2021Muesli: Combining Improvements in Policy Optimizationcited by 53
  10. 2019Off-Policy Actor-Critic with Shared Experience Replaycited by 39
  11. 2019The Value Function Polytope in Reinforcement Learningcited by 29
  12. 2019A Generalized Framework for Population Based Trainingcited by 22
  13. 2019Is Deep Reinforcement Learning Really Superhuman on Atari? Leveling the playing fieldcited by 14

Built on by

Cited by year (2026 to 7 Oct)

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

7 papers.