Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path

Abstract

We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical work, we consider the case when the training data consists of a single sample path (trajectory) of some behaviour policy. In particular, we do not assume access to a generative model of the environment. The algorithm studied is policy iteration where in successive iterations the Q-functions of the intermediate policies are obtained by means of minimizing a novel Bellman-residual type error. PACstyle polynomial bounds are derived on the number of samples needed to guarantee near-optimal performance where the bound depends on the mixing rate of the trajectory, the smoothness properties of the underlying Markovian Decision Problem, the approximation power and capacity of the function set used.
Fichier principal
Vignette du fichier
antos-colt06.pdf (466.11 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

inria-00117130 , version 1 (30-11-2006)

Identifiers

  • HAL Id : inria-00117130 , version 1

Cite

Andras Antos, Csaba Szepesvari, Rémi Munos. Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path. Conference On Learning Theory, Jun 2006, Pittsburgh, USA. ⟨inria-00117130⟩
136 View
1547 Download

Share

Gmail Facebook X LinkedIn More