Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Meta-Inverse Reinforcement Learning with Probabilistic Context Variables

About

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.

Lantao Yu, Tianhe Yu, Chelsea Finn, Stefano Ermon• 2019

Related benchmarks

TaskDatasetResultRank
Policy GeneralizationSweeper (test)
Average Return-74.17
6
Policy GeneralizationSawyer Pusher (test)
Average Return-27.16
6
Policy GeneralizationPoint Maze (test)
Average Return-7.37
6
Policy GeneralizationAnt (test)
Average Return846.2
6
Reward AdaptationPoint-Maze-Shift (meta-test)
Average Return-9.04
4
Reward AdaptationDisabled-Ant meta (test)
Average Return152.6
4
Policy GeneralizationPoint-Maze-Shift (meta-test)
Average Return-28.93
3
Policy GeneralizationDisabled-Ant meta (test)
Average Return-46.77
3
Showing 8 of 8 rows

Other info

Code

Follow for update