SOTAVerified

Meta-Inverse Reinforcement Learning with Probabilistic Context Variables

2019-09-20NeurIPS 2019Code Available0· sign in to hype

Lantao Yu, Tianhe Yu, Chelsea Finn, Stefano Ermon

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Providing a suitable reward function to reinforcement learning can be difficult in many real world applications. While inverse reinforcement learning (IRL) holds promise for automatically learning reward functions from demonstrations, several major challenges remain. First, existing IRL methods learn reward functions from scratch, requiring large numbers of demonstrations to correctly infer the reward for each task the agent may need to perform. Second, existing methods typically assume homogeneous demonstrations for a single behavior or task, while in practice, it might be easier to collect datasets of heterogeneous but related behaviors. To this end, we propose a deep latent variable model that is capable of learning rewards from demonstrations of distinct but related tasks in an unsupervised way. Critically, our model can infer rewards for new, structurally-similar tasks from a single demonstration. Our experiments on multiple continuous control tasks demonstrate the effectiveness of our approach compared to state-of-the-art imitation and inverse reinforcement learning methods.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
AntPEMIRLAverage Return846.18Unverified
Point MazePEMIRLAverage Return-7.37Unverified
Sawyer PusherPEMIRLAverage Return-27.16Unverified
SweeperPEMIRLAverage Return-74.17Unverified

Reproductions