Self-Normalized Inference for Constant-Stepsize Temporal-Difference Learning under Markovian Sampling
Not on the map. Why?
Abstract (arXiv)
Constant-stepsize temporal-difference (TD) learning is attractive for policy evaluation, but inference from a single Markov trajectory must account for serial dependence and a stepsize-dependent stationary target. For fixed-stepsize linear TD, we establish a functional central limit theorem whose covariance retains the multiplicative component induced by the random TD matrix and the stationary iterate error. We then derive a joint functional limit for parallel Richardson--Romberg (RR) recursions driven by the same trajectory. A Brownian-bridge self-normalizer yields asymptotically pivotal confidence regions for prespecified state-value contrasts without estimating the long-run covariance or selecting a bandwidth or batch length. For such a contrast, the procedure admits a one-pass implementation whose memory does not grow with the trajectory length. At a fixed stepsize, the inferential center is the RR stationary target. We also study horizon-indexed designs in which the stepsize remains constant within each run and decreases across longer horizons. Under an explicit RR-dependent rate window, the residual RR target shift, multiplicative remainder, and initialization effect are negligible at the root-n scale, yielding inference for the projected Bellman solution. Experiments on FrozenLake and Garnet illustrate stationary-target coverage, RR target correction, and the finite-sample behavior of the horizon-indexed design.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 26 references that are in the map. First posted on arXiv 11 Aug 2026.
Builds on
16 of 26 references.
References · 16
- 2018A Finite Time Analysis of Temporal Difference Learning With Linear Function Approximationcited by 229
- 2019Finite-Time Error Bounds For Linear Stochastic Approximation and TD Learningcited by 166
- 2020On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentrationcited by 68
- 2021Optimal and instance-dependent guarantees for Markovian linear stochastic approximationcited by 33
- 2022Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Stepsizescited by 30
- 2021Fast and Robust Online Inference with Stochastic Gradient Descent via Random Scalingcited by 28
- 2021On the Stability of Random Matrix Product with Markovian Noise: Application to Linear Stochastic Approximation and TD Learningcited by 23
- 2023Online Statistical Inference for Nonlinear Stochastic Approximation with Markovian Datacited by 20
- 2024Statistical Inference for Policy Evaluation with Temporal Difference Learningcited by 15
- 2025Statistical inference for Linear Stochastic Approximation with Markovian Noisecited by 13
- 2024Revisiting Step-Size Assumptions in Stochastic Approximationcited by 10
- 2024Computing the Bias of Constant-step Stochastic Approximation with Markovian Noisecited by 9
4 more
- 2023Effectiveness of Constant Stepsize in Markovian LSA and Statistical Inferencecited by 5
- 2025Statistical Guarantees for High-Dimensional Stochastic Gradient Descentcited by 2
- 2026Revisiting the Constant Stepsize Stochastic Approximation with Decision-Dependent Markovian Noisecited by 2
- 2025High-Order Error Bounds for Markovian LSA with Richardson-Romberg Extrapolationcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.