mlsanityData to 7 Oct 2026

Learning the Supports for Categorical Critic in Reinforcement Learning

arXiv 2607.01880 ↗First posted 2 Jul 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Value functions are an essential component in actor-critic based deep reinforcement learning (RL). Conventionally, these functions are trained as a regression task by minimising the mean squared error (MSE) relative to bootstrapped target values. Meanwhile, in distributional RL, a distribution of returns is modelled based on the distributional Bellman operator. This work investigates the Gaussian Histogram Loss (HL-Gauss), a recent approach that reframes value estimation as classification by encoding each scalar Bellman target as a Gaussian-smoothed categorical target. Despite its potential, applying histogram-based losses to RL presents inherent challenges, most notably the requirement to pre-define a fixed support interval, which is often complicated by the non-stationary and stochastic nature of target values typically found in RL tasks. In this work, we propose an approach that dynamically learns the lower and upper bounds of the support instead of assigning them beforehand. We derive an objective that jointly learns these bounds whilst learning the categorical representation of the scalar values, and we show that this objective forms an upper bound on the mean-squared Bellman error. Our theoretical analysis further shows that this bound is tighter than that of non-learned supports of HL-Gauss. Empirically, the proposed objective enables stable adaptation of the support interval and matches HL-Gauss-based actor-critic algorithms on most continuous-control tasks whilst improving on a subset, without requiring a pre-specified support interval.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 39 references that are in the map. First posted on arXiv 2 Jul 2026.

Builds on

26 of 39 references.

References · 26

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  2. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  3. 2021Convex optimizationcited by 2,479
  4. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  5. 2021Deep Reinforcement Learning at the Edge of the Statistical Precipicecited by 781
  6. 2017A Distributional Perspective on Reinforcement Learningcited by 743
  7. 2017Distributional Reinforcement Learning with Quantile Regressioncited by 464
  8. 2020dm_control: Software and Tasks for Continuous Controlcited by 368
  9. 2018Implicit Quantile Networks for Distributional Reinforcement Learningcited by 362
  10. 2020Responsive Safety in Reinforcement Learning by PID Lagrangian Methodscited by 302
  11. 2017How to Escape Saddle Points Efficientlycited by 284
  12. 2018Multi-task Deep Reinforcement Learning with PopArtcited by 138
14 more
  1. 2024Stop Regressing: Training Value Functions via Classification for Scalable Deep RLcited by 136
  2. 2024Bigger, Regularized, Optimistic: scaling for compute and sample-efficient continuous controlcited by 104
  3. 2019Fully Parameterized Quantile Function for Distributional Reinforcement Learningcited by 87
  4. 2016Learning values across many orders of magnitudecited by 80
  5. 2018An Analysis of Categorical Distributional Reinforcement Learningcited by 68
  6. 2018Improving Regression Performance with Distributional Lossescited by 66
  7. 2019Statistics and Samples in Distributional Reinforcement Learningcited by 62
  8. 2019A Comparative Analysis of Expected and Distributional Reinforcement Learningcited by 47
  9. 2015When Are Nonconvex Problems Not Scary?cited by 27
  10. 2015How to Discount Deep Reinforcement Learning: Towards New Dynamic Strategiescited by 26
  11. 2017The Global Optimization Geometry of Low-Rank Matrix Optimizationcited by 24
  12. 2024Investigating the Histogram Loss in Regressioncited by 11
  13. 2022Distributional Reinforcement Learning with Regularized Wasserstein Losscited by 8
  14. 2021Intrinsic Benefits of Categorical Distributional Loss: Uncertainty-aware Regularized Exploration in Reinforcement Learningcited by 4

Built on by

Not cited yet.