Normality-Guided Distributional Reinforcement Learning for Continuous Control
Not on the map. Why?
Abstract (arXiv)
Learning a predictive model of the mean return, or value function, plays a critical role in many reinforcement learning algorithms. Distributional reinforcement learning (DRL) has been shown to improve performance by modeling the value distribution, not just the mean. We study the value distribution in several continuous control tasks and find that the learned value distribution is empirically quite close to normal. We design a method that exploits this property, employing variances predicted from a variance network, along with returns, to analytically compute target quantile bars representing a normal for our distributional value function. In addition, we propose a policy update strategy based on the correctness as measured by structural characteristics of the value distribution not present in the standard value function. The approach we outline is compatible with many DRL structures. We use two representative on-policy algorithms, PPO and TRPO, as testbeds. Our method yields statistically significant improvements in 10 out of 16 continuous task settings, while utilizing a reduced number of weights and achieving faster training time compared to an ensemble-based method for quantifying value distribution uncertainty.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 31 of its 48 references that are in the map. First posted on arXiv 28 Aug 2022.
Builds on
31 of 48 references.
References · 31
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2015Trust Region Policy Optimizationcited by 2,580
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,417
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,352
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
- 2016OpenAI Gymcited by 1,736
- 2018Exploration by Random Network Distillationcited by 993
- 2017A Distributional Perspective on Reinforcement Learningcited by 765
19 more
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
- 2016Deep Exploration via Bootstrapped DQNcited by 527
- 2017Distributional Reinforcement Learning with Quantile Regressioncited by 474
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 309
- 2018Distributed Distributional Deterministic Policy Gradientscited by 199
- 2018Understanding the impact of entropy on policy optimizationcited by 176
- 2020SUNRISE: A Simple Unified Framework for Ensemble Learning in Deep Reinforcement Learningcited by 152
- 2017The Cramer Distance as a Solution to Biased Wasserstein Gradientscited by 119
- 2016Q-Prop: Sample-Efficient Policy Gradient with An Off-Policy Criticcited by 81
- 2019Estimating Risk and Uncertainty in Deep Reinforcement Learningcited by 70
- 2019Distributional Reinforcement Learning for Efficient Explorationcited by 60
- 2017EX2: Exploration with Exemplar Models for Deep Reinforcement Learningcited by 42
- 2022Sample Efficient Deep Reinforcement Learning via Uncertainty Estimationcited by 27
- 2016VIME: Variational Information Maximizing Explorationcited by 16
- 2017Efficient exploration with Double Uncertain Value Networkscited by 16
- 2020Implicit Distributional Reinforcement Learningcited by 16
- 2020Sample-based Distributional Policy Gradientcited by 14
- 2019Regularization Matters in Policy Optimizationcited by 13
- 2014Sparse Quantile Huber Regression for Efficient and Robust Estimationcited by 2
Built on by
Citing papers per year: 2024: 1.
1 paper.