mlsanityData to 7 Oct 2026

Exploring Beyond-Demonstrator via Meta Learning-Based Reward Extrapolation

arXiv 2102.02454 ↗First posted 4 Feb 2021cs.LG cs.AIcited by 0

On the map: Offline RL and imitation learning from data → Inverse reinforcement learning

Abstract (arXiv)

Extrapolating beyond-demonstrator (BD) performance through the imitation learning (IL) algorithm aims to learn from and subsequently outperform the demonstrator. To that end, a representative approach is to leverage inverse reinforcement learning (IRL) to infer a reward function from demonstrations before performing RL on the learned reward function. However, most existing reward extrapolation methods require massive demonstrations, making it difficult to be applied in tasks of limited training data. To address this problem, one simple solution is to perform data augmentation to artificially generate more training data, which may incur severe inductive bias and policy performance loss. In this paper, we propose a novel meta learning-based reward extrapolation (MLRE) algorithm, which can effectively approximate the ground-truth rewards using limited demonstrations. More specifically, MLRE first learns an initial reward function from a set of tasks that have abundant training data. Then the learned reward function will be fine-tuned using data of the target task. Extensive simulation results demonstrated that the proposed MLRE can achieve impressive performance improvement as compared to other similar BDIL algorithms.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Inverse reinforcement learning, one of 13 directions in Offline RL and imitation learning from data. Builds on 9 of its 14 references that are in the map. First posted on arXiv 4 Feb 2021.

Builds on

9 of 14 references.

Closest ancestors · 1

Same direction, newest first

  1. 2019Extrapolating Beyond Suboptimal Demonstrations via Inverse Reinforcement Learning from Observations12 Apr

Other references · 8

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  3. 2013Auto-Encoding Variational Bayescited by 3,980
  4. 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
  5. 2018Episodic Curiosity through Reachabilitycited by 109
  6. 2020Learning from Suboptimal Demonstration via Self-Supervised Reward Regressioncited by 84
  7. 2019Wasserstein Adversarial Imitation Learningcited by 59
  8. 2020Intrinsic Reward Driven Imitation Learning via Generative Modelcited by 35

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Beyond-Expert Performance with Limited Demonstrations: Efficient Imitation Learning with Double Exploration
  2. 2025Beyond Imitation: Recovering Dense Rewards from Demonstrations
  3. 2018Learning a Prior over Intent via Meta-Inverse Reinforcement Learning
  4. 2019Better-than-Demonstrator Imitation Learning via Automatically-Ranked Demonstrations
  5. 2019Deep Bayesian Reward Learning from Preferences
  6. 2023BC-IRL: Learning Generalizable Reward Functions from Demonstrations
  7. 2021Versatile Inverse Reinforcement Learning via Cumulative Rewards
  8. 2026Task Parameter Extrapolation via Learning Inverse Tasks from Forward Demonstrations ↗