Truncated Emphatic Temporal Difference Methods for Prediction and Control
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
- 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
- 2019Challenges of Real-World Reinforcement Learningcited by 282
- 2019DualDICE: Behavior-Agnostic Estimation of Discounted Stationary Distribution Correctionscited by 254
- 2018Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimationcited by 226
- 2018A Finite Time Analysis of Temporal Difference Learning With Linear Function Approximationcited by 225
- 2019Finite-Time Error Bounds For Linear Stochastic Approximation and TD Learningcited by 165
- 2015An Emphatic Approach to the Problem of Off-policy Temporal-Difference Learningcited by 103
- 2018Stochastic Variance-Reduced Policy Gradientcited by 103
- 2019Finite-Sample Analysis for SARSA with Linear Function Approximationcited by 85
- 2020GradientDICE: Rethinking Generalized Offline Estimation of Stationary Valuescited by 70
- 2017Stochastic Variance Reduction Methods for Policy Evaluationcited by 56
- 2017Consistent On-Line Off-Policy Evaluationcited by 51
13 more
- 2019Off-Policy Deep Reinforcement Learning by Bootstrapping the Covariate Shiftcited by 47
- 2021Breaking the Deadly Triad with a Target Networkcited by 47
- 2016Unifying task specification in reinforcement learningcited by 41
- 2018An Off-policy Policy Gradient Theorem Using Emphatic Weightingscited by 34
- 2015On Convergence of Emphatic Temporal-Difference Learningcited by 21
- 2015Generalized Emphatic Temporal Difference Learning: Bias-Variance Analysiscited by 17
- 2020Finite-sample Analysis of Greedy-GQ with Linear Function Approximation under Markovian Noisecited by 17
- 2019Separating value functions across time-scalescited by 15
- 2019A Unified Switching System Perspective and O.D.E. Analysis of Q-Learning Algorithmscited by 14
- 2019Fixed-Horizon Temporal Difference Methods for Stable Reinforcement Learningcited by 12
- 2021Emphatic Algorithms for Deep Reinforcement Learningcited by 12
- 2017Convergent Tree Backup and Retrace with Function Approximationcited by 11
- 2017On Convergence of some Gradient-based Temporal-Differences Algorithms for Off-Policy Learningcited by 11
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1; 2025: 3; 2026: 4.
10 papers.
- 2023Revisiting a Design Choice in Gradient Temporal Difference Learningcited by 7
- 2024Almost Sure Convergence of Linear Temporal Difference Learning with Arbitrary Featurescited by 5
- 2025Finite Sample Analysis of Linear Temporal Difference Learning with Arbitrary Featurescited by 5
- 2025Towards Formalizing Reinforcement Learning Theory: A Robbins-Siegmund Approachcited by 5
- 2021PER-ETD: A Polynomially Efficient Emphatic Temporal Difference Learning Methodcited by 2
- 2026Almost Sure Convergence of Differential Temporal Difference Learning for Average Reward Markov Decision Processescited by 2
- 2025Functional Critics Are Essential for Actor-Critic: From Off-Policy Stability to Efficient Explorationcited by 0
- 2026Almost Sure Convergence Rates of Stochastic Approximation and Reinforcement Learning via a Poisson-Moreau Driftcited by 0
- 2026Bellman Calibration for Marginalized Importance Weighting in Offline Reinforcement Learningcited by 0
- 2026Regularized Emphatic Temporal-Difference Learning: Stability under Constant Stepsizescited by 0
- 2026Regularized Emphatic Temporal-Difference Learning: Stability under Constant Stepsizes14 Sep 2026
- 2026Bellman Calibration for Marginalized Importance Weighting in Offline Reinforcement Learning25 Aug 2026
- 2026Almost Sure Convergence Rates of Stochastic Approximation and Reinforcement Learning via a Poisson-Moreau Drift8 May 2026
- 2026Almost Sure Convergence of Differential Temporal Difference Learning for Average Reward Markov Decision Processes18 Feb 2026
- 2025Towards Formalizing Reinforcement Learning Theory: A Robbins-Siegmund Approach5 Nov 2025
- 2025Functional Critics Are Essential for Actor-Critic: From Off-Policy Stability to Efficient Exploration26 Sep 2025
- 2025Finite Sample Analysis of Linear Temporal Difference Learning with Arbitrary Features27 May 2025
- 2024Almost Sure Convergence of Linear Temporal Difference Learning with Arbitrary Features18 Sep 2024
- 2023Revisiting a Design Choice in Gradient Temporal Difference Learning2 Aug 2023
- 2021PER-ETD: A Polynomially Efficient Emphatic Temporal Difference Learning Method13 Oct 2021