login

The Convergence of TD(λ) for General λ

Machine LearningPublished 1 May 1992Open access
Peter Dayan
Citations49
SJR quartileQ1
SJR score1.15
SNIP2.14
View PDF

TL;DR

Watkins' theorem that $$\mathcal{Q}$$ -learning, his closely related prediction and action learning method, converges with probability one is adapted to demonstrate this strong form of convergence for a slightly modified version of TD.

Abstract

The method of temporal differences (TD) is one way of making consistent predictions about the future. This paper uses some analysis of Watkins (1989) to extend a convergence theorem due to Sutton (1988) from the case which only uses information from adjacent time steps to that involving information from arbitrary ones. It also considers how this version of TD behaves in the face of linearly dependent representations for states—demonstrating that it still converges, but to a different answer from the least mean squares algorithm. Finally it adapts Watkins' theorem that $$\mathcal{Q}$$ -learning, his closely related prediction and action learning method, converges with probability one, to demonstrate this strong form of convergence for a slightly modified version of TD.

Keywords

Computer ScienceEconomics, Econometrics and Finance