Offline Policy Evaluation via Mixed Bellman Residuals and Adaptive Critic Representations
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 3 of its 37 references that are in the map. First posted on arXiv 27 Sep 2026.
Builds on
3 of 37 references.
References · 3
- 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,920
- 2014Stochastic Compositional Gradient Descent: Algorithms for Minimizing Compositions of Expected-Value Functionscited by 95
- 2022Why Should I Trust You, Bellman? The Bellman Error is a Poor Replacement for Value Errorcited by 32
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Residuals-based Offline Reinforcement Learning
- 2022Bellman Residual Orthogonalization for Offline Reinforcement Learning
- 2022Learning Bellman Complete Representations for Offline Policy Evaluation
- 2026Deep Weighted Bellman Residual Minimization for Q^* Estimation
- 2026CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning
- 2025Learning to Trust Bellman Updates: Selective State-Adaptive Regularization for Offline RL
- 2025Bellman Calibration for V-Learning in Offline Reinforcement Learning
- 2026Bellman Calibration for Marginalized Importance Weighting in Offline Reinforcement Learning