Robust Imitation via Mirror Descent Inverse Reinforcement Learning
On the map: Offline RL and imitation learning from data → Inverse reinforcement learning
Abstract (arXiv)
Recently, adversarial imitation learning has shown a scalable reward acquisition method for inverse reinforcement learning (IRL) problems. However, estimated reward signals often become uncertain and fail to train a reliable statistical model since the existing methods tend to solve hard optimization problems directly. Inspired by a first-order optimization method called mirror descent, this paper proposes to predict a sequence of reward functions, which are iterative solutions for a constrained convex problem. IRL solutions derived by mirror descent are tolerant to the uncertainty incurred by target density estimation since the amount of reward learning is regulated with respect to local geometric constraints. We prove that the proposed mirror descent update rule ensures robust minimization of a Bregman divergence in terms of a rigorous regret bound of O(1/T) for step sizes ηtt=1T. Our IRL method was applied on top of an adversarial framework, and it outperformed existing adversarial methods in an extensive suite of benchmarks.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Placed in Inverse reinforcement learning, one of 13 directions in Offline RL and imitation learning from data. Builds on 23 of its 65 references that are in the map. First posted on arXiv 20 Oct 2022.
Builds on
23 of 65 references.
Closest ancestors · 3
Same direction, newest first
- 2020f-IRL: Inverse Reinforcement Learning via State Marginal Matching9 Nov
- 2020Regularized Inverse Reinforcement Learning7 Oct
- 2018Maximum Causal Tsallis Entropy Imitation Learning22 May
Other references · 20
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2021Convex optimizationcited by 2,479
- 2016Generative Adversarial Imitation Learningcited by 1,576
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
- 2016TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systemscited by 660
- 2017Learning Robust Rewards with Adversarial Inverse Reinforcement Learningcited by 485
- 2019A Theory of Regularized Markov Decision Processescited by 279
- 2018Discriminator-Actor-Critic: Addressing Sample Inefficiency and Reward Bias in Adversarial Imitation Learningcited by 203
- 2019A Divergence Minimization Perspective on Imitation Learning Methodscited by 188
- 2021Policy Mirror Descent for Reinforcement Learning: Linear Convergence, New Sampling Complexity, and Generalized Problem Classescited by 149
- 2018Reinforcement and Imitation Learning for Diverse Visuomotor Skillscited by 124
- 2020Primal Wasserstein Imitation Learningcited by 120
8 more
- 2020Mirror Descent Policy Optimizationcited by 102
- 2017Robust Imitation of Diverse Behaviorscited by 85
- 2021Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergencecited by 83
- 2017Triple Generative Adversarial Netscited by 59
- 2017Dual Discriminator Generative Adversarial Netscited by 55
- 2013The Information Geometry of Mirror Descentcited by 53
- 2018Convergence of Online Mirror Descentcited by 3
- 2019BreGMN: scaled-Bregman Generative Modeling Networkscited by 2
Built on by
Citing papers per year: 2024: 2; 2025: 3.
5 papers.
- 2025Rectified Robust Policy Optimization for Model-Uncertain Constrained Reinforcement Learning without Strong Dualitycited by 4
- 2024Expert Proximity as Surrogate Rewards for Single Demonstration Imitation Learningcited by 2
- 2025Variational Online Mirror Descent for Robust Learning in Schr"odinger Bridgecited by 2
- 2025Mirror Descent Using the Tempesta Generalized Multi-parametric Logarithmscited by 1
- 2024Multi Task Inverse Reinforcement Learning for Common Sense Rewardcited by 0
- 2025Rectified Robust Policy Optimization for Model-Uncertain Constrained Reinforcement Learning without Strong Duality24 Aug 2025
- 2025Mirror Descent Using the Tempesta Generalized Multi-parametric Logarithms8 Jun 2025
- 2025Variational Online Mirror Descent for Robust Learning in Schr"odinger Bridge3 Apr 2025
- 2024Multi Task Inverse Reinforcement Learning for Common Sense Reward17 Feb 2024
- 2024Expert Proximity as Surrogate Rewards for Single Demonstration Imitation Learning1 Feb 2024
Similar, not cited
Close in wording, no citation either way
- 2023Adversarial Imitation Learning On Aggregated Data
- 2024Rethinking Adversarial Inverse Reinforcement Learning: Policy Imitation, Transferable Reward Recovery and Algebraic Equilibrium Proof
- 2022Option-Aware Adversarial Inverse Reinforcement Learning for Robotic Control
- 2020Reparameterized Variational Divergence Minimization for Stable Imitation
- 2023Provably Efficient Adversarial Imitation Learning with Unknown Transitions
- 2021Meta-Adversarial Inverse Reinforcement Learning for Decision-making Tasks
- 2023Inverse Reinforcement Learning with the Average Reward Criterion
- 2019Wasserstein Adversarial Imitation Learning