Analysis of a Classification-based Policy Iteration Algorithm - Archive ouverte HAL Access content directly
Reports (Technical Report) Year : 2010

Analysis of a Classification-based Policy Iteration Algorithm

Alessandro Lazaric
Mohammad Ghavamzadeh
  • Function : Author
  • PersonId : 868946
Remi Munos
  • Function : Author
  • PersonId : 836863


We present a classification-based policy iteration algorithm, called Direct Policy Iteration, and provide its finite-sample analysis. Our results state a performance bound in terms of the number of policy improvement steps, the number of rollouts used in each iteration, the capacity of the considered policy space, and a new capacity measure which indicates how well the policy space can approximate policies that are greedy w.r.t. any of its members. The analysis reveals a tradeoff between the estimation and approximation errors in this classification-based policy iteration setting. We also study the consistency of the method when there exists a sequence of policy spaces with increasing capacity.
Fichier principal
Vignette du fichier
dpi-tech.pdf (280.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00482065 , version 1 (07-05-2010)
inria-00482065 , version 2 (25-01-2011)
inria-00482065 , version 3 (30-01-2012)


  • HAL Id : inria-00482065 , version 1


Alessandro Lazaric, Mohammad Ghavamzadeh, Remi Munos. Analysis of a Classification-based Policy Iteration Algorithm. [Technical Report] 2010. ⟨inria-00482065v1⟩
444 View
565 Download


Gmail Facebook Twitter LinkedIn More