On the Statistical Benefits of Temporal Difference Learning
David Cheikhi, Daniel Russo
Abstract
Given a dataset on actions and resulting long-term rewards, a direct estimation approach fits value functions that minimize prediction error on the training data. Temporal difference learning (TD) methods instead fit value functions by minimizing the degree of temporal inconsistency between estimates made at successive time-steps. Focusing on finite state Markov chains, we provide a crisp asymptotic theory of the statistical advantages of this approach. First, we show that an intuitive inverse trajectory pooling coefficient completely characterizes the percent reduction in mean-squared error of value estimates. Depending on problem structure, the reduction could be enormous or nonexistent. Next, we prove that there can be dramatic improvements in estimates of the difference in value-to-go for two states: TD's errors are bounded in terms of a novel measure -the problem's trajectory crossing time -which can be much smaller than the problem's time horizon. 1. The relative benefits of TD are determined by a natural 'inverse trajectory pooling coefficient.' TD uses value-to-go at intermediate states as a surrogate (Athey et al., 2019; Prentice, 1989) .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6849bb2b-ae2c-4a07-b8db-4ac3ba7424a7Cited by top-tier papers6
- The Statistical Benefits of Quantile Temporal-Difference Learning for Value EstimationMark Rowland, Yunhao Tang, Clare Lyle, Rémi Munos et al.ICML 2023 · 13 citations
- The surprising efficiency of temporal difference learning for rare event predictionXiaoou Cheng, Jonathan WeareNeurIPS 2024 · 10 citations
- Incremental Sequence Classification with Temporal ConsistencyLucas Maystre, Gabriel Barello, Tudor Berariu, Aleix Cambray et al.NeurIPS 2025 · 3 citations
- Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RLMatthew Zurek, Guy Zamir, Yudong ChenNeurIPS 2025 · 2 citations
- QHyer: Q-conditioned Hybrid Attention-mamba Transformer for Offline Goal-conditioned RLXing Lei, Jincheng Wang, Xuetao Zhang, Donglin WangICML 2026
Builds on2
Related papers
- Towards Parameter-Free Temporal Difference LearningYunxiang LI, Mark Schmidt, Reza Babanezhad, Sharan VaswaniICML 2026 · 2 citations
- Temporal Difference Learning as Gradient SplittingRui Liu, Alex OlshevskyICML 2021 · 18 citations
- Uncorrected Least-Squares Temporal Difference with Lambda-ReturnTakayuki OsogamiAAAI 2020 · 1 citation
- Reducing Sampling Error in Batch Temporal Difference LearningBrahma S. Pavse, Ishan Durugkar, Josiah Hanna, Peter StoneICML 2020 · 14 citations
- Towards a better understanding of representation dynamics under TD-learningYunhao Tang, Rémi MunosICML 2023 · 3 citations
