User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse




Conference Paper

Bootstrapping apprenticeship learning


Boularias,  A.
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Boularias, A., & Chaib-Draa, B. (2011). Bootstrapping apprenticeship learning. In J. Lafferty (Ed.), 24th Annual Conference on Neural Information Processing Systems (NIPS 2010) (pp. 289-297). Red Hook, NY: Curran.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-4CD1-2
We consider the problem of apprenticeship learning where the examples, demonstrated by an expert, cover only a small part of a large state space. Inverse Reinforcement Learning (IRL) provides an efficient tool for generalizing the demonstration, based on the assumption that the expert is maximizing a utility function that is a linear combination of state-action features. Most IRL algorithms use a simple Monte Carlo estimation to approximate the expected feature counts under the expert's policy. In this paper, we show that the quality of the learned policies is highly sensitive to the error in estimating the feature counts. To reduce this error, we introduce a novel approach for bootstrapping the demonstration by assuming that: (i), the expert is (near-)optimal, and (ii), the dynamics of the system is known. Empirical results on gridworlds and car racing problems show that our approach is able to learn good policies from a small number of demonstrations.