On The Reduction Of Variance And Overestimation Of Deep Q-learning

Abstract

The breakthrough of deep Q-Learning on different types of environments revolutionized the algorithmic design of Reinforcement Learning to introduce more stable and robust algorithms, to that end many extensions to deep Q-Learning algorithm have been proposed to reduce the variance of the target values and the overestimation phenomena. In this paper, we examine new methodology to solve these issues, we propose using Dropout techniques on deep Q-Learning algorithm as a way to reduce variance and overestimation. We also present experiments conducted on benchmark environments, demonstrating the effectiveness of our methodology in enhancing stability and reducing both variance and overestimation in model performance.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keysabry2019on

Related papers

• Sample Dropout: A Simple Yet Effective Variance Reduction Technique In Deep Policy Optimization (2023)0.00
• Suppressing Overestimation In Q-learning Through Adversarial Behaviors (2023)2.26
• Reducing Variance In Temporal-difference Value Estimation Via Ensemble Of Deep Networks (2022)0.00
• An Information-theoretic Optimality Principle For Deep Reinforcement Learning (2017)0.00
• Deep Q-learning: Theoretical Insights From An Asymptotic Analysis (2020)10.35
• A Theoretical Analysis Of Deep Q-learning (2019)0.00
• Averaged-dqn: Variance Reduction And Stabilization For Deep Reinforcement Learning (2016)0.00
• Generalization And Regularization In DQN (2018)0.00