mlsanityData to 7 Oct 2026

β-DQN: Improving Deep Q-Learning By Evolving the Behavior

arXiv 2501.00913 ↗First posted 1 Jan 2025cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

While many sophisticated exploration methods have been proposed, their lack of generality and high computational cost often lead researchers to favor simpler methods like ε-greedy. Motivated by this, we introduce β-DQN, a simple and efficient exploration method that augments the standard DQN with a behavior function β. This function estimates the probability that each action has been taken at each state. By leveraging β, we generate a population of diverse policies that balance exploration between state-action coverage and overestimation bias correction. An adaptive meta-controller is designed to select an effective policy for each episode, enabling flexible and explainable exploration. β-DQN is straightforward to implement and adds minimal computational overhead to the standard DQN. Experiments on both simple and challenging exploration domains show that β-DQN outperforms existing baseline methods across a wide range of tasks, providing an effective solution for improving exploration in deep reinforcement learning.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 29 of its 64 references that are in the map. First posted on arXiv 1 Jan 2025.

Builds on

29 of 64 references.

References · 29

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  3. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  4. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  5. 2018Exploration by Random Network Distillationcited by 966
  6. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  7. 2016Deep Exploration via Bootstrapped DQNcited by 518
  8. 2020Planning to Explore via Self-Supervised World Modelscited by 365
  9. 2023Minigrid & Miniworld: Modular & Customizable Reinforcement Learning Environments for Goal-Oriented Taskscited by 320
  10. 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
  11. 2020Agent57: Outperforming the Atari Human Benchmarkcited by 300
  12. 2020First return, then explorecited by 256
17 more
  1. 2017Count-Based Exploration with Neural Density Modelscited by 255
  2. 2020Revisiting Fundamentals of Experience Replaycited by 171
  3. 2021Tianshou: a Highly Modularized Deep Reinforcement Learning Librarycited by 139
  4. 2016Averaged-DQN: Variance Reduction and Stabilization for Deep Reinforcement Learningcited by 106
  5. 2020Revisiting Rainbow: Promoting more Insightful and Inclusive Deep Reinforcement Learning Researchcited by 78
  6. 2020DisCor: Corrective Feedback in Reinforcement Learning via Distribution Correctioncited by 71
  7. 2022BYOL-Explore: Exploration by Bootstrapped Predictioncited by 71
  8. 2021On Bonus-Based Exploration Methods in the Arcade Learning Environmentcited by 37
  9. 2020BeBold: Exploration Beyond the Boundary of Explored Regionscited by 32
  10. 2022Why Should I Trust You, Bellman? The Bellman Error is a Poor Replacement for Value Errorcited by 31
  11. 2023Flipping Coins to Estimate Pseudocounts for Exploration in Reinforcement Learningcited by 28
  12. 2021When should agents explore?cited by 20
  13. 2023Seizing Serendipity: Exploiting the Value of Past Success in Off-Policy Actor-Criticcited by 20
  14. 2023Learnable Behavior Control: Breaking Atari Human World Records via Sample-Efficient Behavior Selectioncited by 14
  15. 2020Novel Policy Seeking with Constrained Optimizationcited by 11
  16. 2024Efficient Preference-based Reinforcement Learning via Aligned Experience Estimationcited by 9
  17. 2023LESSON: Learning to Integrate Exploration Strategies for Reinforcement Learning via an Option Frameworkcited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.