Intrinsic Benefits of Categorical Distributional Loss: Uncertainty-aware Regularized Exploration in Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
The remarkable empirical performance of distributional reinforcement learning (RL) has garnered increasing attention to understanding its theoretical advantages over classical RL. By decomposing the categorical distributional loss commonly employed in distributional RL, we find that the potential superiority of distributional RL can be attributed to a derived distribution-matching entropy regularization. This less-studied entropy regularization aims to capture additional knowledge of return distribution beyond only its expectation, contributing to an augmented reward signal in policy optimization. In contrast to the vanilla entropy regularization in MaxEnt RL, which explicitly encourages exploration by promoting diverse actions, the novel entropy regularization derived from categorical distributional loss implicitly updates policies to align the learned policy with (estimated) environmental uncertainty. Finally, extensive experiments verify the significance of this uncertainty-aware regularization from distributional RL on the empirical benefits over classical RL. Our study offers an innovative exploration perspective to explain the intrinsic benefits of distributional learning in RL.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 31 of its 71 references that are in the map. First posted on arXiv 7 Oct 2021.
Builds on
31 of 71 references.
References · 31
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
- 2019When Does Label Smoothing Help?cited by 985
- 2017A Distributional Perspective on Reinforcement Learningcited by 743
- 2017Reinforcement Learning with Deep Energy-Based Policiescited by 659
- 2016Deep Exploration via Bootstrapped DQNcited by 518
- 2017Distributional Reinforcement Learning with Quantile Regressioncited by 464
- 2017Towards Principled Methods for Training Generative Adversarial Networkscited by 460
- 2018Implicit Quantile Networks for Distributional Reinforcement Learningcited by 362
19 more
- 2020On the Global Convergence Rates of Softmax Policy Gradient Methodscited by 258
- 2019A Theoretical Analysis of Deep Q-Learningcited by 212
- 2020SUNRISE: A Simple Unified Framework for Ensemble Learning in Deep Reinforcement Learningcited by 150
- 2017The Cramer Distance as a Solution to Biased Wasserstein Gradientscited by 116
- 2014Generalization and Exploration via Randomized Value Functionscited by 112
- 2019Fully Parameterized Quantile Function for Distributional Reinforcement Learningcited by 87
- 2021Conservative Offline Distributional Reinforcement Learningcited by 78
- 2018An Analysis of Categorical Distributional Reinforcement Learningcited by 68
- 2018Efficient Exploration through Bayesian Deep Q-Networkscited by 67
- 2018Improving Regression Performance with Distributional Lossescited by 66
- 2019Statistics and Samples in Distributional Reinforcement Learningcited by 62
- 2019Distributional Reinforcement Learning for Efficient Explorationcited by 59
- 2021Exploration in Deep Reinforcement Learning: From Single-Agent to Multiagent Domaincited by 57
- 2019A Comparative Analysis of Expected and Distributional Reinforcement Learningcited by 47
- 2021A Max-Min Entropy Framework for Reinforcement Learningcited by 28
- 2020Optimal Bounds between f-Divergences and Integral Probability Metricscited by 27
- 2018Exploration by Distributional Reinforcement Learningcited by 13
- 2021Exploring the Training Robustness of Distributional Reinforcement Learning against Noisy State Observationscited by 11
- 2020Distributional Reinforcement Learning via Moment Matchingcited by 10
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 3.
4 papers.
- 2026Demystifying Group Relative Policy Optimization: Its Policy Gradient is a U-Statisticcited by 19
- 2022Distributional Reinforcement Learning with Regularized Wasserstein Losscited by 8
- 2026Distributional Active Inferencecited by 0
- 2026Learning the Supports for Categorical Critic in Reinforcement Learningcited by 0
- 2026Learning the Supports for Categorical Critic in Reinforcement Learning2 Jul 2026
- 2026Demystifying Group Relative Policy Optimization: Its Policy Gradient is a U-Statistic1 Mar 2026
- 2026Distributional Active Inference28 Jan 2026
- 2022Distributional Reinforcement Learning with Regularized Wasserstein Loss1 Feb 2022