English

Imitation Learning as $f$-Divergence Minimization

Machine Learning 2020-06-02 v2 Information Theory Robotics math.IT Machine Learning

Abstract

We address the problem of imitation learning with multi-modal demonstrations. Instead of attempting to learn all modes, we argue that in many tasks it is sufficient to imitate any one of them. We show that the state-of-the-art methods such as GAIL and behavior cloning, due to their choice of loss function, often incorrectly interpolate between such modes. Our key insight is to minimize the right divergence between the learner and the expert state-action distributions, namely the reverse KL divergence or I-projection. We propose a general imitation learning framework for estimating and minimizing any f-Divergence. By plugging in different divergences, we are able to recover existing algorithms such as Behavior Cloning (Kullback-Leibler), GAIL (Jensen Shannon) and Dagger (Total Variation). Empirical results show that our approximate I-projection technique is able to imitate multi-modal behaviors more reliably than GAIL and behavior cloning.

Keywords

Cite

@article{arxiv.1905.12888,
  title  = {Imitation Learning as $f$-Divergence Minimization},
  author = {Liyiming Ke and Sanjiban Choudhury and Matt Barnes and Wen Sun and Gilwoo Lee and Siddhartha Srinivasa},
  journal= {arXiv preprint arXiv:1905.12888},
  year   = {2020}
}

Comments

International Workshop on the Algorithmic Foundations of Robotics (WAFR) 2020

R2 v1 2026-06-23T09:32:44.854Z