Bellman Error Centering
Not on the map. Why?
Abstract (arXiv)
This paper revisits the recently proposed reward centering algorithms including simple reward centering (SRC) and value-based reward centering (VRC), and points out that SRC is indeed the reward centering, while VRC is essentially Bellman error centering (BEC). Based on BEC, we provide the centered fixpoint for tabular value functions, as well as the centered TD fixpoint for linear value function approximation. We design the on-policy CTD algorithm and the off-policy CTDC algorithm, and prove the convergence of both algorithms. Finally, we experimentally validate the stability of our proposed algorithms. Bellman error centering facilitates the extension to various reinforcement learning algorithms.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 5 Feb 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2024Reward Centering
- 2024The Role of Inherent Bellman Error in Offline Reinforcement Learning with Linear Function Approximation
- 2025Bellman Calibration for V-Learning in Offline Reinforcement Learning
- 2024A Variance Minimization Approach to Temporal-Difference Learning
- 2026Extending Differential Temporal Difference Methods for Episodic Problems
- 2024Linear Bellman Completeness Suffices for Efficient Online Reinforcement Learning with Few Actions
- 2026Score Centering Stabilizes Off-policy Reinforcement Learning
- 2024Steady-State Error Compensation for Reinforcement Learning with Quadratic Rewards