LSTD with Random Projections - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

LSTD with Random Projections

(1) , (1) , (1) , (1)
1

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.
Not file

Dates and versions

hal-00943120 , version 1 (07-02-2014)

Identifiers

  • HAL Id : hal-00943120 , version 1

Cite

Mohammad Ghavamzadeh, Alessandro Lazaric, Odalric Maillard, Rémi Munos. LSTD with Random Projections. Advances in Neural Information Processing Systems, 2010, Granada, Spain. ⟨hal-00943120⟩
88 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More