Imitation Learning from Suboptimal Demonstrations via Meta-Learning An Action Ranker
On the map: Offline RL and imitation learning from data → Imitation learning methods
Abstract (arXiv)
A major bottleneck in imitation learning is the requirement of a large number of expert demonstrations, which can be expensive or inaccessible. Learning from supplementary demonstrations without strict quality requirements has emerged as a powerful paradigm to address this challenge. However, previous methods often fail to fully utilize their potential by discarding non-expert data. Our key insight is that even demonstrations that fall outside the expert distribution but outperform the learned policy can enhance policy performance. To utilize this potential, we propose a novel approach named imitation learning via meta-learning an action ranker (ILMAR). ILMAR implements weighted behavior cloning (weighted BC) on a limited set of expert demonstrations along with supplementary demonstrations. It utilizes the functional of the advantage function to selectively integrate knowledge from the supplementary demonstrations. To make more effective use of supplementary demonstrations, we introduce meta-goal in ILMAR to optimize the functional of the advantage function by explicitly minimizing the distance between the current policy and the expert policy. Comprehensive experiments using extensive tasks demonstrate that ILMAR significantly outperforms previous methods in handling suboptimal demonstrations. Code is available at https://github.com/F-GOD6/ILMAR.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Imitation learning methods, one of 13 directions in Offline RL and imitation learning from data. Builds on 20 of its 30 references that are in the map. First posted on arXiv 28 Dec 2024.
Builds on
20 of 30 references.
Closest ancestors · 4
Same direction, newest first
- 2022Discriminator-Weighted Offline Imitation Learning from Suboptimal Demonstrations20 Jul
- 2022Imitation Learning by Estimating Expertise of Demonstrators2 Feb
- 2021Confidence-Aware Imitation Learning from Demonstrations with Varying Optimality27 Oct
- 2019Imitation Learning from Imperfect Demonstration27 Jan
Other references · 16
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
- 2016Generative Adversarial Imitation Learningcited by 1,576
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
- 2015End-to-End Training of Deep Visuomotor Policiescited by 847
- 2020Deep Reinforcement Learning for Autonomous Driving: A Surveycited by 698
- 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 413
- 2017Inverse Reward Designcited by 246
- 2017One-Shot Imitation Learningcited by 232
- 2017One-Shot Visual Imitation Learning via Meta-Learningcited by 225
4 more
- 2023Grounding Large Language Models in Interactive Environments with Online Reinforcement Learningcited by 193
- 2018Meta-Gradient Reinforcement Learningcited by 156
- 2022Learning Smooth Neural Functions via Lipschitz Regularizationcited by 86
- 2022Transfering Hierarchical Structure with Dual Meta Imitation Learningcited by 7
Built on by
Citing papers per year: 2025: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2019Watch, Try, Learn: Meta-Learning from Demonstrations and Reward
- 2023Skill Disentanglement for Imitation Learning from Suboptimal Demonstrations
- 2022A Ranking Game for Imitation Learning
- 2023Good Better Best: Self-Motivated Imitation Learning for noisy Demonstrations
- 2019A Divergence Minimization Perspective on Imitation Learning Methods
- 2021Learning from Imperfect Demonstrations from Agents with Varying Dynamics
- 2019VILD: Variational Imitation Learning with Diverse-quality Demonstrations
- 2026Difference-Aware Retrieval Policies for Imitation Learning