Skip to content

Offline Policy Evaluation via Mixed Bellman Residuals and Adaptive Critic Representations

Sep 2026 · 0 citations
Mathematics Computer Science

TL;DR

A convex combination of one-step and two-step residuals with a fixed mixing weight is considered to provide a natural bias--variance trade-off between approximation error under a restricted value-function class and the increased variance arising from multi-step importance weighting.

Abstract

Evaluating a target policy using data generated by a different behavior policy remains a fundamental challenge in reinforcement learning. While most existing work relies on the standard one-step Bellman residual, we consider a convex combination of one-step and two-step residuals with a fixed mixing weight. In ideal settings, this mixed Bellman formulation can provide a natural bias--variance trade-off between approximation error under a restricted value-function class and the increased variance arising from multi-step importance weighting. To solve this mixed residual optimization, we adopt a minimax formulation involving a critic function. Unlike standard approaches that rely on a fixed functional class, we construct a data-dependent critic representation using predicted future feature directions which effectively induces a kernel adapted to the underlying transition dynamics. This allows the critic to focus on directions that are most relevant for the estimated Bellman error. To control overfitting, we use sample splitting to construct the critic and estimate the value function on separate data subsets. Simulation studies and MetaWorld tasks illustrate the effect of the mixing parameter and show that intermediate residual combinations can improve value estimation in challenging settings.

View source

Similar papers

Preprint Aug 2026

Bellman Calibration for Marginalized Importance Weighting in Offline Reinforcement Learning

The introduction of isotonic Bellman calibration, a one-dimensional, model-agnostic post-processing method that reduces residual occupancy-balance violations while preserving the ranking information in any initial occupancy-ratio estimate, and establishes finite-sample calibration guarantees and a KL oracle inequality...

L. van der Laan, Nathan Kallus · 0 citations
#machine learning Preprint Sep 2026

Deep Weighted Bellman Residual Minimization for $Q^*$ Estimation

A weighted Bellman residual minimization framework that incorporates density ratio weighting by effectively integrating expert demonstrations with behavioral data is introduced, providing specific guidance for the rational utilization of expert demonstrations.

Li-Can Kang, Jerry Zhijian Yang, Cheng Yuan et al. · 0 citations
Preprint Sep 2026

Is One Step Enough for Offline Policy Improvement?

This work studies how policy improvement is composed through multi-step proximal policy improvement (MPI), which re-centers each proximal objective on the preceding policy, and identifies improvement composition as a design choice alongside regularization strength, with distinct effects from horizon subdivision and add...

Soohyun Choi, Seonvin Cho, Songnam Hong · 0 citations
#artificial intelligence Preprint Sep 2026

Lifted Bellman Linear Programming for Offline Reinforcement Learning

Offline reinforcement learning (RL) typically trains a critic by minimizing a regression loss against bootstrapped value targets stabilized by target networks with exponential moving average (EMA) updates. Multi-step targets incorporate behavior-policy actions and therefore require off-policy correction. We instead imp...

Hyukjun Yang, Jongchan Park, Narim Jeong et al. · 0 citations
#artificial intelligence Preprint Oct 2026

FERPO: Forward Entropy-Regularized Policy Optimization

Several state-of-the-art methods for online reinforcement learning in continuous control improve policies using action gradients of a learned critic. However, critics are typically trained to predict returns, and accurate value predictions do not necessarily yield accurate action derivatives, potentially leading to unr...

Sebastian Sanokowski, Alireza Sarmadi, Majid Khadiv · 0 citations

Sparse Additive Off-Policy Evaluation for Reinforcement Learning with Potentially Limited Number of Trajectories

A new framework for flexible, nonlinear, and interpretable off-policy evaluation for infinite-horizon reinforcement learning is developed and a group-sparsity-based feature screening procedure is proposed that identifies, with high probability, a reduced feature set containing all relevant covariates.

Tuo-Yi Zhao, Cheng-Chun Shi, Zheng-Ling Qi et al. · 0 citations

Related blog posts

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