mlsanityData to 7 Oct 2026

Truncated Emphatic Temporal Difference Methods for Prediction and Control

arXiv 2108.05338 ↗First posted 11 Aug 2021cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Emphatic Temporal Difference (TD) methods are a class of off-policy Reinforcement Learning (RL) methods involving the use of followon traces. Despite the theoretical success of emphatic TD methods in addressing the notorious deadly triad of off-policy RL, there are still two open problems. First, followon traces typically suffer from large variance, making them hard to use in practice. Second, though Yu (2015) confirms the asymptotic convergence of some emphatic TD methods for prediction problems, there is still no finite sample analysis for any emphatic TD method for prediction, much less control. In this paper, we address those two open problems simultaneously via using truncated followon traces in emphatic TD methods. Unlike the original followon traces, which depend on all previous history, truncated followon traces depend on only finite history, reducing variance and enabling the finite sample analysis of our proposed emphatic TD methods for both prediction and control.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 25 of its 58 references that are in the map. First posted on arXiv 11 Aug 2021.

Builds on

25 of 58 references.

References · 25

  1. 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
  2. 2019Challenges of Real-World Reinforcement Learningcited by 282
  3. 2019DualDICE: Behavior-Agnostic Estimation of Discounted Stationary Distribution Correctionscited by 254
  4. 2018Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimationcited by 226
  5. 2018A Finite Time Analysis of Temporal Difference Learning With Linear Function Approximationcited by 225
  6. 2019Finite-Time Error Bounds For Linear Stochastic Approximation and TD Learningcited by 165
  7. 2015An Emphatic Approach to the Problem of Off-policy Temporal-Difference Learningcited by 103
  8. 2018Stochastic Variance-Reduced Policy Gradientcited by 103
  9. 2019Finite-Sample Analysis for SARSA with Linear Function Approximationcited by 85
  10. 2020GradientDICE: Rethinking Generalized Offline Estimation of Stationary Valuescited by 70
  11. 2017Stochastic Variance Reduction Methods for Policy Evaluationcited by 56
  12. 2017Consistent On-Line Off-Policy Evaluationcited by 51
13 more
  1. 2019Off-Policy Deep Reinforcement Learning by Bootstrapping the Covariate Shiftcited by 47
  2. 2021Breaking the Deadly Triad with a Target Networkcited by 47
  3. 2016Unifying task specification in reinforcement learningcited by 41
  4. 2018An Off-policy Policy Gradient Theorem Using Emphatic Weightingscited by 34
  5. 2015On Convergence of Emphatic Temporal-Difference Learningcited by 21
  6. 2015Generalized Emphatic Temporal Difference Learning: Bias-Variance Analysiscited by 17
  7. 2020Finite-sample Analysis of Greedy-GQ with Linear Function Approximation under Markovian Noisecited by 17
  8. 2019Separating value functions across time-scalescited by 15
  9. 2019A Unified Switching System Perspective and O.D.E. Analysis of Q-Learning Algorithmscited by 14
  10. 2019Fixed-Horizon Temporal Difference Methods for Stable Reinforcement Learningcited by 12
  11. 2021Emphatic Algorithms for Deep Reinforcement Learningcited by 12
  12. 2017Convergent Tree Backup and Retrace with Function Approximationcited by 11
  13. 2017On Convergence of some Gradient-based Temporal-Differences Algorithms for Off-Policy Learningcited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1; 2025: 3; 2026: 4.

10 papers.