OPIRL: Sample Efficient Off-policy Inverse Reinforcement Learning Via Distribution Matching

Abstract

Inverse Reinforcement Learning (IRL) is attractive in scenarios where reward engineering can be tedious. However, prior IRL algorithms use on-policy transitions, which require intensive sampling from the current policy for stable and optimal performance. This limits IRL applications in the real world, where environment interactions can become highly expensive. To tackle this problem, we present Off-Policy Inverse Reinforcement Learning (OPIRL), which (1) adopts off-policy data distribution instead of on-policy and enables significant reduction of the number of interactions with the environment, (2) learns a stationary reward function that is transferable with high generalization capabilities on changing dynamics, and (3) leverages mode-covering behavior for faster convergence. We demonstrate that our method is considerably more sample efficient and generalizes to novel environments through the experiments. Our method achieves better or comparable results on policy performance baselines

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyhoshino2021opirl

Related papers

• Distributional Inverse Reinforcement Learning (2025)0.00
• Inverse Reinforcement Learning Without Reinforcement Learning (2023)0.00
• Non-adversarial Inverse Reinforcement Learning Via Successor Feature Matching (2024)0.00
• Inverse Reinforcement Learning With Simultaneous Estimation Of Rewards And Dynamics (2016)0.00
• Active Exploration For Inverse Reinforcement Learning (2022)0.00
• Offline RL With No OOD Actions: In-sample Learning Via Implicit Value Regularization (2023)0.00
• A Survey Of Inverse Reinforcement Learning: Challenges, Methods And Progress (2018)0.00
• Offline Inverse RL: New Solution Concepts And Provably Efficient Algorithms (2024)0.00