Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Finite-Sample Analysis of LSTD

Alessandro Lazaric 1 Mohammad Ghavamzadeh 1 Remi Munos 1 
1 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
Abstract : In this paper we consider the problem of policy evaluation in reinforcement learning, i.e., learning the value function of a fixed policy, using the least-squares temporal-difference (LSTD) learning algorithm. We report a finite-sample analysis of LSTD. We first derive a bound on the performance of the LSTD solution evaluated at the states generated by the Markov chain and used by the algorithm to learn an estimate of the value function. This result is general in the sense that no assumption is made on the existence of a stationary distribution for the Markov chain. We then derive generalization bounds in the case when the Markov chain possesses a stationary distribution and is $\beta$-mixing.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Mohammad Ghavamzadeh Connect in order to contact the contributor
Submitted on : Sunday, May 9, 2010 - 8:42:27 PM
Last modification on : Thursday, January 20, 2022 - 4:16:22 PM
Long-term archiving on: : Thursday, September 16, 2010 - 1:18:05 PM


Files produced by the author(s)


  • HAL Id : inria-00482189, version 1



Alessandro Lazaric, Mohammad Ghavamzadeh, Remi Munos. Finite-Sample Analysis of LSTD. ICML - 27th International Conference on Machine Learning, Jun 2010, Haifa, Israel. pp.615-622. ⟨inria-00482189⟩



Record views


Files downloads