English

Robust Imitation Learning from Noisy Demonstrations

Machine Learning 2021-02-22 v3 Artificial Intelligence Machine Learning

Abstract

Robust learning from noisy demonstrations is a practical but highly challenging problem in imitation learning. In this paper, we first theoretically show that robust imitation learning can be achieved by optimizing a classification risk with a symmetric loss. Based on this theoretical finding, we then propose a new imitation learning method that optimizes the classification risk by effectively combining pseudo-labeling with co-training. Unlike existing methods, our method does not require additional labels or strict assumptions about noise distributions. Experimental results on continuous-control benchmarks show that our method is more robust compared to state-of-the-art methods.

Keywords

Cite

@article{arxiv.2010.10181,
  title  = {Robust Imitation Learning from Noisy Demonstrations},
  author = {Voot Tangkaratt and Nontawat Charoenphakdee and Masashi Sugiyama},
  journal= {arXiv preprint arXiv:2010.10181},
  year   = {2021}
}

Comments

16 pages, 9 figures. Accepted to AISTATS 2021

R2 v1 2026-06-23T19:29:00.722Z