Improving the Diversity of Bootstrapped DQN by Replacing Priors With Noise
Not on the map. Why?
Abstract (arXiv)
Q-learning is one of the most well-known Reinforcement Learning algorithms. There have been tremendous efforts to develop this algorithm using neural networks. Bootstrapped Deep Q-Learning Network is amongst them. It utilizes multiple neural network heads to introduce diversity into Q-learning. Diversity can sometimes be viewed as the amount of reasonable moves an agent can take at a given state, analogous to the definition of the exploration ratio in RL. Thus, the performance of Bootstrapped Deep Q-Learning Network is deeply connected with the level of diversity within the algorithm. In the original research, it was pointed out that a random prior could improve the performance of the model. In this article, we further explore the possibility of replacing priors with noise and sample the noise from a Gaussian distribution to introduce more diversity into this algorithm. We conduct our experiment on the Atari benchmark and compare our algorithm to both the original and other related algorithms. The results show that our modification of the Bootstrapped Deep Q-Learning algorithm achieves significantly higher evaluation scores across different types of Atari games. Thus, we conclude that replacing priors with noise can improve Bootstrapped Deep Q-Learning's performance by ensuring the integrity of diversities.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 22 of its 41 references that are in the map. First posted on arXiv 2 Mar 2022.
Builds on
22 of 41 references.
References · 22
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2016Generative Adversarial Imitation Learningcited by 1,576
- 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,528
- 2021Deep Reinforcement Learning at the Edge of the Statistical Precipicecited by 781
- 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
- 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 734
- 2016Deep Exploration via Bootstrapped DQNcited by 518
- 2019Using Self-Supervised Learning Can Improve Model Robustness and Uncertaintycited by 511
- 2017A Tutorial on Thompson Samplingcited by 420
- 2020Planning to Explore via Self-Supervised World Modelscited by 365
10 more
- 2017Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agentscited by 267
- 2017Noisy Networks for Explorationcited by 262
- 2020First return, then explorecited by 256
- 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 218
- 2019Go-Explore: a New Approach for Hard-Exploration Problemscited by 207
- 2017Parameter Space Noise for Explorationcited by 158
- 2017Deep Exploration via Randomized Value Functionscited by 155
- 2014Generalization and Exploration via Randomized Value Functionscited by 112
- 2015Bootstrapped Thompson Sampling and Deep Explorationcited by 40
- 2018Randomized Value Functions via Multiplicative Normalizing Flowscited by 15
Built on by
Citing papers per year: 2023: 1; 2024: 2.
3 papers.