Regularized Centered Emphatic Temporal Difference Learning
Not on the map. Why?
Abstract (arXiv)
Off-policy temporal-difference (TD) learning with function approximation faces a structural tradeoff among stability, projection geometry, and variance control. Emphatic TD (ETD) improves the off-policy projection geometry through follow-on emphasis, but the follow-on trace can have high variance. We revisit this tradeoff through Bellman-error centering. Although centering naturally removes a common drift term from TD errors, we show that a naive centered emphatic extension introduces an auxiliary coupling that can destroy the positive-definiteness of the ETD key matrix. We propose Regularized Emphatic Temporal-Difference Learning (RETD), which preserves the follow-on trace and regularizes only the auxiliary centering recursion, corresponding to lifting the lower-right block of the coupled key matrix from (1) to (1+c). We derive the RETD core matrix, prove convergence under a conservative sufficient regularization condition, and evaluate the method on diagnostic linear off-policy prediction tasks. The experiments show that RETD avoids the instability of naive centered emphatic learning, preserves favorable emphatic geometry, and exhibits a robust intermediate regime for the regularization parameter (c) across the diagnostics.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 18 references that are in the map. First posted on arXiv 2 May 2026.
Builds on
9 of 18 references.
References · 9
- 2015An Emphatic Approach to the Problem of Off-policy Temporal-Difference Learningcited by 103
- 2020Gradient Temporal-Difference Learning with Regularized Correctionscited by 38
- 2024The ODE Method for Stochastic Approximation and Reinforcement Learning with Markovian Noisecited by 24
- 2015Generalized Emphatic Temporal Difference Learning: Bias-Variance Analysiscited by 17
- 2021Emphatic Algorithms for Deep Reinforcement Learningcited by 12
- 2020Proximal Gradient Temporal Difference Learning: Stable Reinforcement Learning with Polynomial Sample Complexitycited by 7
- 2021Learning Expected Emphatic Traces for Deep RLcited by 5
- 2021PER-ETD: A Polynomially Efficient Emphatic Temporal Difference Learning Methodcited by 2
- 2025Bellman Error Centeringcited by 2
Built on by
Not cited yet.