Inverse Reinforcement Learning from Non-Stationary Learning Agents
On the map: Offline RL and imitation learning from data → Inverse reinforcement learning
Abstract (arXiv)
In this paper, we study an inverse reinforcement learning problem that involves learning the reward function of a learning agent using trajectory data collected while this agent is learning its optimal policy. To address this problem, we propose an inverse reinforcement learning method that allows us to estimate the policy parameters of the learning agent which can then be used to estimate its reward function. Our method relies on a new variant of the behavior cloning algorithm, which we call bundle behavior cloning, and uses a small number of trajectories generated by the learning agent's policy at different points in time to learn a set of policies that match the distribution of actions observed in the sampled trajectories. We then use the cloned policies to train a neural network model that estimates the reward function of the learning agent. We provide a theoretical analysis to show a complexity result on bound guarantees for our method that beats standard behavior cloning as well as numerical experiments for a reinforcement learning problem that validate the proposed method.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Inverse reinforcement learning, one of 13 directions in Offline RL and imitation learning from data. Builds on 8 of its 22 references that are in the map. First posted on arXiv 18 Oct 2024.
Builds on
8 of 22 references.
Closest ancestors · 2
Same direction, newest first
- 2020Revisiting Maximum Entropy Inverse Reinforcement Learning: New Perspectives and Algorithms1 Dec
- 2020Inverse Reinforcement Learning from a Gradient-based Learner15 Jul
Other references · 6
- 2017Constrained Policy Optimizationcited by 983
- 2021A Survey of Uncertainty in Deep Neural Networkscited by 680
- 2019Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithmscited by 567
- 2018An Algorithmic Perspective on Imitation Learningcited by 459
- 2020FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPscited by 233
- 2018Machine Theory of Mindcited by 226
Built on by
Citing papers per year: 2025: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2021Versatile Inverse Reinforcement Learning via Cumulative Rewards
- 2024Stable Inverse Reinforcement Learning: Policies from Control Lyapunov Landscapes
- 2019Integrating Behavior Cloning and Reinforcement Learning for Improved Performance in Dense and Sparse Reward Environments
- 2025Generalizing Behavior via Inverse Reinforcement Learning with Closed-Form Reward Centroids
- 2023Coherent Soft Imitation Learning
- 2021Inverse Reinforcement Learning: A Control Lyapunov Approach
- 2020Inverse Reinforcement Learning via Matching of Optimality Profiles
- 2026Coherent Off-Policy Improvement of Large Behavior Models with Learned Rewards