English

A Primer on Maximum Causal Entropy Inverse Reinforcement Learning

Machine Learning 2022-03-23 v1 Artificial Intelligence

Abstract

Inverse Reinforcement Learning (IRL) algorithms infer a reward function that explains demonstrations provided by an expert acting in the environment. Maximum Causal Entropy (MCE) IRL is currently the most popular formulation of IRL, with numerous extensions. In this tutorial, we present a compressed derivation of MCE IRL and the key results from contemporary implementations of MCE IRL algorithms. We hope this will serve both as an introductory resource for those new to the field, and as a concise reference for those already familiar with these topics.

Keywords

Cite

@article{arxiv.2203.11409,
  title  = {A Primer on Maximum Causal Entropy Inverse Reinforcement Learning},
  author = {Adam Gleave and Sam Toyer},
  journal= {arXiv preprint arXiv:2203.11409},
  year   = {2022}
}

Comments

29 pages

R2 v1 2026-06-24T10:21:22.656Z