Bellman Calibration for V-Learning in Offline Reinforcement Learning

Lars van der Laan, Nathan Kallus
12/29/2025
stat.MLcs.LGecon.EM

No confident code implementation found for this paper.

Abstract

We introduce Iterated Bellman Calibration, a simple, model-agnostic, post-hoc procedure for calibrating off-policy value predictions in infinite-horizon Markov decision processes. Bellman calibration requires that states with similar predicted long-term returns exhibit one-step returns consistent with the Bellman equation under the target policy. We adapt classical histogram and isotonic calibration to the dynamic, counterfactual setting by repeatedly regressing fitted Bellman targets onto a model's predictions, using a doubly robust pseudo-outcome to handle off-policy data. This yields a one-dimensional fitted value iteration scheme that can be applied to any value estimator. Our analysis provides finite-sample guarantees for both calibration and prediction under weak assumptions, and critically, without requiring Bellman completeness or realizability.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{laan2025bellman,
  title  = {Bellman Calibration for V-Learning in Offline Reinforcement Learning},
  author = {Lars van der Laan and Nathan Kallus},
  year   = {2025},
  eprint = {2512.23694},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.23694v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.23694.svg)](https://codeofpaper.com/paper/2512.23694)

Discussion