LGMLJun 18, 2019

Sample-efficient Adversarial Imitation Learning from Observation

arXiv:1906.07374v114 citations
Originality Incremental advance
AI Analysis

This work addresses the sample inefficiency problem for deploying imitation learning algorithms on physical robots, representing an incremental improvement over existing methods.

The paper tackles the high sample complexity in adversarial imitation learning from observation by proposing a new algorithm that improves learning efficiency, demonstrating faster learning rates and efficiency in both simulated and physical robot arm tasks.

Imitation from observation is the framework of learning tasks by observing demonstrated state-only trajectories. Recently, adversarial approaches have achieved significant performance improvements over other methods for imitating complex behaviors. However, these adversarial imitation algorithms often require many demonstration examples and learning iterations to produce a policy that is successful at imitating a demonstrator's behavior. This high sample complexity often prohibits these algorithms from being deployed on physical robots. In this paper, we propose an algorithm that addresses the sample inefficiency problem by utilizing ideas from trajectory centric reinforcement learning algorithms. We test our algorithm and conduct experiments using an imitation task on a physical robot arm and its simulated version in Gazebo and will show the improvement in learning rate and efficiency.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes