Inverse Reinforcement Learning by Estimating Expertise of Demonstrators

Mark Beliaev, Ramtin Pedarsani
2/2/2024
cs.LGcs.AI

No official code found. Best implementation: mbeliaev1/IRLEED (5 stars, MIT, last commit 2025-05-20).

Abstract

In Imitation Learning (IL), utilizing suboptimal and heterogeneous demonstrations presents a substantial challenge due to the varied nature of real-world data. However, standard IL algorithms consider these datasets as homogeneous, thereby inheriting the deficiencies of suboptimal demonstrators. Previous approaches to this issue rely on impractical assumptions like high-quality data subsets, confidence rankings, or explicit environmental knowledge. This paper introduces IRLEED, Inverse Reinforcement Learning by Estimating Expertise of Demonstrators, a novel framework that overcomes these hurdles without prior knowledge of demonstrator expertise. IRLEED enhances existing Inverse Reinforcement Learning (IRL) algorithms by combining a general model for demonstrator suboptimality to address reward bias and action variance, with a Maximum Entropy IRL framework to efficiently derive the optimal policy from diverse, suboptimal demonstrations. Experiments in both online and offline IL settings, with simulated and human-generated data, demonstrate IRLEED's adaptability and effectiveness, making it a versatile solution for learning from suboptimal demonstrations.

View on arXivView PDF

Code Implementations(1)

mbeliaev1/IRLEEDCommunity100%
MIT

Companion code for 2025 AAAI paper "Inverse Reinforcement Learning by Estimating Expertise of Demonstrators"

50Shell, PythonSep 22, 20231 years agoMIT

Similar Papers

Cite this paper

@article{beliaev2024inverse,
  title  = {Inverse Reinforcement Learning by Estimating Expertise of Demonstrators},
  author = {Mark Beliaev and Ramtin Pedarsani},
  year   = {2024},
  eprint = {2402.01886},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.01886v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.01886.svg)](https://codeofpaper.com/paper/2402.01886)

Discussion