mlsanityData to 7 Oct 2026

New Versions of Gradient Temporal Difference Learning

arXiv 2109.04033 ↗First posted 9 Sep 2021cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Sutton, Szepesv'ari and Maei introduced the first gradient temporal-difference (GTD) learning algorithms compatible with both linear function approximation and off-policy training. The goal of this paper is (a) to propose some variants of GTDs with extensive comparative analysis and (b) to establish new theoretical analysis frameworks for the GTDs. These variants are based on convex-concave saddle-point interpretations of GTDs, which effectively unify all the GTDs into a single framework, and provide simple stability analysis based on recent results on primal-dual gradient dynamics. Finally, numerical comparative analysis is given to evaluate these approaches.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 9 of its 33 references that are in the map. First posted on arXiv 9 Sep 2021.

Builds on

9 of 33 references.

References · 9

  1. 2021Convex optimizationcited by 2,479
  2. 2018Multi-Agent Reinforcement Learning via Double Averaging Primal-Dual Optimizationcited by 40
  3. 2020Gradient Temporal-Difference Learning with Regularized Correctionscited by 38
  4. 2021A Generalized Projected Bellman Error for Off-policy Value Estimation in Reinforcement Learningcited by 26
  5. 2013Distributed Policy Evaluation Under Multiple Behavior Strategiescited by 17
  6. 2016Stochastic Primal-Dual Methods and Sample Complexity of Reinforcement Learningcited by 15
  7. 2018On the Exponential Stability of Primal-Dual Gradient Dynamicscited by 12
  8. 2019Fast Multi-Agent Temporal-Difference Learning via Homotopy Stochastic Primal-Dual Optimizationcited by 3
  9. 2018Primal-Dual Distributed Temporal Difference Learningcited by 1

Built on by

Cited by year (2026 to 7 Oct)

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

6 papers.