Skip to content
Preprint

Learning the Supports for Categorical Critic in Reinforcement Learning

Jul 2026 · 0 citations · 39 references
Computer Science

TL;DR

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, and derives an objective that forms an upper bound on the mean-squared Bellman error.

Abstract

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.

View source

Similar papers

Preprint Aug 2026

Start Classifying: Categorical Critics for LLM Reinforcement Learning

Proximal Policy Optimization (PPO) for large language models typically trains its critic by mean-squared-error (MSE) regression on scalar value targets. Although scalar MSE is statistically valid for estimating the conditional expected return, sparse binary rewards in reinforcement learning with verifiable rewards (RLV...

Zhi-Jian Zhou, Long Li, Xuan Zhang et al. · 2 citations · ⚡2
Preprint Aug 2026

Simple Actors and Deep Critics for Scalable Reinforcement Learning

This work revisits where capacity should be invested in an offline actor--critic method and proposes LAC (Light Actor, deep Critic), a lightweight deterministic actor that matches the strongest diffusion- and flow-matching baselines while achieving up to 4x lower inference latency.

Gu-Heon Kang, Jaehwi Lee, Minhae Kwon · 1 citation

Reducing Scalar Rewards to Binary Success: General Off-Policy Learning with Success Functions

It is shown that any discounted-reward problem can be recast as a modified, reward-free problem with a single success state and an equivalent optimal policy, and any value-learning problem can be trained by classification with cross-entropy, in a way that is in principle exact and suffers no loss of precision.

Armaan A. Abraham · 0 citations
Jul 2026

LEMUR: Learning to Align with Multi-Objective Reinforcement Learning from Preference Feedback

This work develops LEMUR: Learning to Align with Multi-Objective Reinforcement Learning with Preference feedback, a novel framework where an agent interactively learns from the preferences of multiple humans to learn optimal multi-objective policies.

Manith Adikari, Bei Peng, Samuele Vinanzi et al. · 0 citations
Preprint Aug 2026

Efficient Hypergradient Descent for Inverse Reinforcement Learning

This work shows that, at the inner optimum, the Hessian of the inner objective is proportional to the Fisher information matrix of the policy, yielding a structured Fisher-based hypergradient closely related to Natural Hypergradient Descent.

Nikita Sevriukov, A. Barabanova, Uliana Gagarina et al. · 0 citations
Jul 2026

Constrained Reinforcement Learning Using Successor Representations

The Safe Deep Successor Representation is proposed, a novel method that allows quick retraining of policies towards new cost structures and is competitive on a simple navigation task while being considerably more flexible.

Michaela Girstl, Alexander Mattick, Christopher Mutschler · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.