Skip to Main content Skip to Navigation
Conference papers

LSTD with Random Projections

M. Ghavamzadeh 1 A. Lazaric 1 O. A. Maillard 1 R. Munos 1
1 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal, Inria Lille - Nord Europe
Abstract : We consider the problem of reinforcement learning in high-dimensional spaces when the number of features is bigger than the number of samples. In particular, we study the least-squares temporal difference (LSTD) learning algorithm when a space of low dimension is generated with a random projection from a high-dimensional space. We provide a thorough theoretical analysis of the LSTD with random projections and derive performance bounds for the resulting algorithm. We also show how the error of LSTD with random projections is propagated through the iterations of a policy iteration algorithm and provide a performance bound for the resulting least-squares policy iteration (LSPI) algorithm.
Complete list of metadatas
Contributor : Philippe Preux <>
Submitted on : Friday, February 7, 2014 - 8:23:54 AM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM


  • HAL Id : hal-00943120, version 1



M. Ghavamzadeh, A. Lazaric, O. A. Maillard, R. Munos. LSTD with Random Projections. Advances in Neural Information Processing Systems, 2010, Granada, Spain. ⟨hal-00943120⟩



Record views