TRAIL: Near-Optimal Imitation Learning with Suboptimal Data
Mengjiao Yang, Sergey Levine, Ofir Nachum
摘要
The aim in imitation learning is to learn effective policies by utilizing near-optimal expert demonstrations. However, high-quality demonstrations from human experts can be expensive to obtain in large number. On the other hand, it is often much easier to obtain large quantities of suboptimal or task-agnostic trajectories, which are not useful for direct imitation, but can nevertheless provide insight into the dynamical structure of the environment, showing what could be done in the environment even if not what should be done. We ask the question, is it possible to utilize such suboptimal offline datasets to facilitate provably improved downstream imitation learning? In this work, we answer this question affirmatively and present training objectives that use offline datasets to learn a factored transition model whose structure enables the extraction of a latent action space. Our theoretical analysis shows that the learned latent action space can boost the sample-efficiency of downstream imitation learning, effectively reducing the need for large near-optimal expert datasets through the use of auxiliary non-expert data. To learn the latent action space in practice, we propose TRAIL (Transition-Reparametrized Actions for Imitation Learning), an algorithm that learns an energy-based transition model contrastively, and uses the transition model to reparametrize the action space for sample-efficient imitation learning. We evaluate the practicality of our objective through experiments on a set of navigation and locomotion tasks. Our results verify the benefits suggested by our theory and show that TRAIL is able to improve baseline imitation learning by up to 4x in performance. 1
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper18
- How to Leverage Unlabeled Data in Offline Reinforcement LearningTianhe Yu, Aviral Kumar, Yevgen Chebotar, Karol Hausman 等ICML 2022 · 被引用 78 次
- Imitation Learning by Estimating Expertise of DemonstratorsMark Beliaev, Andy Shih, Stefano Ermon, Dorsa Sadigh 等ICML 2022 · 被引用 60 次
- Making Linear MDPs Practical via Contrastive Representation LearningTianjun Zhang, Tongzheng Ren, Mengjiao Yang, Joseph Gonzalez 等ICML 2022 · 被引用 57 次
- Chain of Thought Imitation with Procedure CloningMengjiao Yang, Dale Schuurmans, Pieter Abbeel, Ofir NachumNeurIPS 2022 · 被引用 53 次
- Inverse Dynamics Pretraining Learns Good Representations for Multitask ImitationDavid Brandfonbrener, Ofir Nachum, Joan BrunaNeurIPS 2023 · 被引用 38 次
它引用的顶会 Paper10
- Dynamics-Aware Unsupervised Discovery of SkillsArchit Sharma, Shixiang Gu, Sergey Levine, Vikash Kumar 等ICLR 2020 · 被引用 475 次
- Parrot: Data-Driven Behavioral Priors for Reinforcement LearningAvi Singh, Huihan Liu, Gaoyue Zhou, Albert Yu 等ICLR 2021 · 被引用 161 次
- Learning Robot Skills with Temporal Variational InferenceTanmay Shankar, Abhinav GuptaICML 2020 · 被引用 80 次
- Learning Invariant Representations for Reinforcement Learning without ReconstructionAmy Zhang, Rowan Thomas McAllister, Roberto Calandra, Yarin Gal 等ICLR 2021 · 被引用 77 次
- Provable Representation Learning for Imitation Learning via Bi-level OptimizationSanjeev Arora, Simon S. Du, Sham M. Kakade, Yuping Luo 等ICML 2020 · 被引用 65 次
相关 Paper
- Provable Representation Learning for Imitation with Contrastive Fourier FeaturesOfir Nachum, Mengjiao YangNeurIPS 2021 · 被引用 41 次
- IOSTOM: Offline Imitation Learning from Observations via State Transition Occupancy MatchingQuang Anh Pham, Janaka Chathuranga Brahmanage, Tien Mai, Akshat KumarNeurIPS 2025 · 被引用 2 次
- Representation Matters: Offline Pretraining for Sequential Decision MakingMengjiao Yang, Ofir NachumICML 2021 · 被引用 126 次
- Optimal Transport for Offline Imitation LearningYicheng Luo, Zhengyao Jiang, Samuel Cohen, Edward Grefenstette 等ICLR 2023 · 被引用 2 次
- SPRINQL: Sub-optimal Demonstrations driven Offline Imitation LearningHuy Hoang, Tien Mai, Pradeep VarakanthamNeurIPS 2024 · 被引用 12 次
