English

Preference elicitation and inverse reinforcement learning

Machine Learning 2011-06-30 v2 Machine Learning

Abstract

We state the problem of inverse reinforcement learning in terms of preference elicitation, resulting in a principled (Bayesian) statistical formulation. This generalises previous work on Bayesian inverse reinforcement learning and allows us to obtain a posterior distribution on the agent's preferences, policy and optionally, the obtained reward sequence, from observations. We examine the relation of the resulting approach to other statistical methods for inverse reinforcement learning via analysis and experimental results. We show that preferences can be determined accurately, even if the observed agent's policy is sub-optimal with respect to its own preferences. In that case, significantly improved policies with respect to the agent's preferences are obtained, compared to both other methods and to the performance of the demonstrated policy.

Keywords

Cite

@article{arxiv.1104.5687,
  title  = {Preference elicitation and inverse reinforcement learning},
  author = {Constantin Rothkopf and Christos Dimitrakakis},
  journal= {arXiv preprint arXiv:1104.5687},
  year   = {2011}
}

Comments

13 pages, 4 figures; ECML 2011

R2 v1 2026-06-21T18:00:33.379Z