LiMIIRL: Lightweight Multiple-Intent Inverse Reinforcement Learning
On the map: Offline RL and imitation learning from data → Inverse reinforcement learning
Abstract (arXiv)
Multiple-Intent Inverse Reinforcement Learning (MI-IRL) seeks to find a reward function ensemble to rationalize demonstrations of different but unlabelled intents. Within the popular expectation maximization (EM) framework for learning probabilistic MI-IRL models, we present a warm-start strategy based on up-front clustering of the demonstrations in feature space. Our theoretical analysis shows that this warm-start solution produces a near-optimal reward ensemble, provided the behavior modes satisfy mild separation conditions. We also propose a MI-IRL performance metric that generalizes the popular Expected Value Difference measure to directly assesses learned rewards against the ground-truth reward ensemble. Our metric elegantly addresses the difficulty of pairing up learned and ground truth rewards via a min-cost flow formulation, and is efficiently computable. We also develop a MI-IRL benchmark problem that allows for more comprehensive algorithmic evaluations. On this problem, we find our MI-IRL warm-start strategy helps avoid poor quality local minima reward ensembles, resulting in a significant improvement in behavior clustering. Our extensive sensitivity analysis demonstrates that the quality of the learned reward ensembles is improved under various settings, including cases where our theoretical assumptions do not necessarily hold. Finally, we demonstrate the effectiveness of our methods by discovering distinct driving styles in a large real-world dataset of driver GPS trajectories.
Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Placed in Inverse reinforcement learning, one of 13 directions in Offline RL and imitation learning from data. Builds on 12 of its 41 references that are in the map. First posted on arXiv 3 Jun 2021.
Builds on
12 of 41 references.
Closest ancestors · 3
Same direction, newest first
- 2020Revisiting Maximum Entropy Inverse Reinforcement Learning: New Perspectives and Algorithms1 Dec
- 2019Meta-Inverse Reinforcement Learning with Probabilistic Context Variables20 Sep
- 2018Multi-task Maximum Entropy Inverse Reinforcement Learning22 May
Other references · 9
- 2017Learning Robust Rewards with Adversarial Inverse Reinforcement Learningcited by 486
- 2019Goal-conditioned Imitation Learningcited by 160
- 2014Statistical guarantees for the EM algorithm: From population to sample-based analysiscited by 131
- 2019Imitation Learning as f-Divergence Minimizationcited by 121
- 2020Quantifying Differences in Reward Functionscited by 63
- 2017OptionGAN: Learning Joint Reward-Policy Options using Generative Adversarial Inverse Reinforcement Learningcited by 40
- 2015Adjusting for Chance Clustering Comparison Measurescited by 27
- 2020Joint Goal and Strategy Inference across Heterogeneous Demonstrators via Reward Network Distillationcited by 19
- 2020Sinkhorn EM: An Expectation-Maximization algorithm based on entropic optimal transportcited by 7
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2026Generalize and Guide: Decomposing Rewards for Few-Shot Inverse Reinforcement Learning
- 2024Automated Feature Selection for Inverse Reinforcement Learning
- 2024Bayesian Inverse Reinforcement Learning for Non-Markovian Rewards
- 2021Deep Adaptive Multi-Intention Inverse Reinforcement Learning
- 2020Efficient Exploration of Reward Functions in Inverse Reinforcement Learning via Bayesian Optimization
- 2018A Survey of Inverse Reinforcement Learning: Challenges, Methods and Progress
- 2024How does Inverse RL Scale to Large State Spaces? A Provably Efficient Approach
- 2025Reward Compatibility: A Framework for Inverse RL