Augmenting GAIL With BC For Sample Efficient Imitation Learning

Abstract

Imitation learning is the problem of recovering an expert policy without access to a reward signal. Behavior cloning and GAIL are two widely used methods for performing imitation learning. Behavior cloning converges in a few iterations but doesn't achieve peak performance due to its inherent iid assumption about the state-action distribution. GAIL addresses the issue by accounting for the temporal dependencies when performing a state distribution matching between the agent and the expert. Although GAIL is sample efficient in the number of expert trajectories required, it is still not very sample efficient in terms of the environment interactions needed for convergence of the policy. Given the complementary benefits of both methods, we present a simple and elegant method to combine both methods to enable stable and sample efficient learning. Our algorithm is very simple to implement and integrates with different policy gradient algorithms. We demonstrate the effectiveness of the algorit

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyjena2020augmenting

Related papers

• Interactive And Hybrid Imitation Learning: Provably Beating Behavior Cloning (2024)0.00
• A Pragmatic Look At Deep Imitation Learning (2021)0.00
• When Will Generative Adversarial Imitation Learning Algorithms Attain Global Convergence (2020)0.00
• C-GAIL: Stabilizing Generative Adversarial Imitation Learning With Control Theory (2024)0.00
• Provably Efficient Generative Adversarial Imitation Learning For Online And Offline Setting With Linear Function Approximation (2021)0.00
• A Bayesian Solution To The Imitation Gap (2024)0.00
• Mimicking Better By Matching The Approximate Action Distribution (2023)0.00
• Provably Efficient Adversarial Imitation Learning With Unknown Transitions (2023)0.00