Learning Utilities from Demonstrations in Markov Decision Processes
Filippo Lazzati, Alberto Maria Metelli
Abstract
Although it is well-known that humans commonly engage in risk-sensitive behaviors in the presence of stochasticity, most Inverse Reinforcement Learning (IRL) models assume a riskneutral agent. As such, beyond piq introducing model misspecification, piiq they do not permit direct inference of the risk attitude of the observed agent, which can be useful in many applications. In this paper, we propose a novel model of behavior to cope with these issues. By allowing for risk sensitivity, our model alleviates piq, and by explicitly representing risk attitudes through (learnable) utility functions, it solves piiq. Then, we characterize the partial identifiability of an agent's utility under the new model and note that demonstrations from multiple environments mitigate the problem. We devise two provably-efficient algorithms for learning utilities in a finite-data regime, and we conclude with some proof-of-concept experiments to validate both our model and our algorithms.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7e20ed4f-6d8a-4024-9b9a-517db361df52Cited by top-tier papers3
- Imitation Learning as Return Distribution MatchingFilippo Lazzati, Alberto Maria MetelliICLR 2026 · 1 citation
- Provably Efficient Exploration in Inverse Constrained Reinforcement LearningBo Yue, Jian Li, Guiliang LiuICML 2025
- Robustness in the Face of Partial Identifiability in Reward LearningFilippo Lazzati, Alberto Maria MetelliICLR 2026
Builds on10
- Invariance in Policy Optimisation and Partial Identifiability in Reward LearningJoar Max Viktor Skalse, Matthew Farrugia-Roberts, Stuart Russell, Alessandro Abate et al.ICML 2023 · 56 citations
- Provably Efficient Learning of Transferable RewardsAlberto Maria Metelli, Giorgia Ramponi, Alessandro Concetti, Marcello RestelliICML 2021 · 36 citations
- Learning Shared Safety Constraints from Multi-task DemonstrationsKonwoo Kim, Gokul Swamy, Zuxin Liu, Ding Zhao et al.NeurIPS 2023 · 31 citations
- Towards Theoretical Understanding of Inverse Reinforcement LearningAlberto Maria Metelli, Filippo Lazzati, Marcello RestelliICML 2023 · 21 citations
- Inverse Constrained Reinforcement LearningShehryar Malik, Usman Anwar, Alireza Aghasi, Ali AhmedICML 2021 · 14 citations
Related papers
- Bounded Risk-Sensitive Markov Games: Forward Policy Design and Inverse Reward Learning with Iterative Reasoning and Cumulative Prospect TheoryRan Tian, Liting Sun, Masayoshi TomizukaAAAI 2021 · 13 citations
- Quantifying the Sensitivity of Inverse Reinforcement Learning to MisspecificationJoar Max Viktor Skalse, Alessandro AbateICLR 2024 · 5 citations
- Bayesian Robust Optimization for Imitation LearningDaniel S. Brown, Scott Niekum, Marek PetrikNeurIPS 2020 · 43 citations
- Offline Inverse RL: New Solution Concepts and Provably Efficient AlgorithmsFilippo Lazzati, Mirco Mutti, Alberto Maria MetelliICML 2024 · 8 citations
- Inferring Heterogeneous Private Valuations from Offline Market Data via Entropic Risk-Sensitive Utility MaximizationXingyu Qian, Haoran YuAAAI 2026
