atlas

Research map / Multi-agent systems and games / Human-AI and goal-conditioned

Deep Demonstration Tracing: Learning Generalizable Imitator Policy for Runtime Imitation from a Single Demonstration

ICML 2024 · Multi-agent systems and games › Human-AI and goal-conditioned · approach: Imitation and skill learning

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes Deep Demonstration Tracing (DDT), a demonstration-transformer policy trained with SAC under a context-based meta-RL and OSIL-reward setup, for one-shot imitation that generalizes to unforeseen changes after the demonstration.

Problem

One-shot imitation learning often assumes demonstration-time and deployment-time situations are similar; it fails when unforeseen changes (e.g., obstacles) occur after the demonstration, requiring the imitator to generalize beyond demonstrated states.

Approach

A demonstration transformer whose attention structure mirrors a 3-stage human-like tracing process (identify relevant expert states, analyze expert behavior, trace back to the demonstration), combined with training the imitator as a context-based meta-RL policy with SAC and a stationary imitation reward, rather than behavior cloning.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use DDT instead of the strongest baselineVPAM imitation policy · VPAM Trainsuccess rate: 0.84 -> 0.86Helped
use DDT instead of the strongest baselineVPAM imitation policy · VPAM Non-Obstaclesuccess rate: 0.71 -> 0.73Helped
use DDT instead of the strongest baselineVPAM imitation policy · VPAM Unforeseen Obstaclesuccess rate: 0.57 -> 0.62Helped
use DDT instead of DCRLMeta-World imitation policy · Meta-World, with disturbance, unseen demonstrationssuccess rate: 0.12±0.14 -> 0.61±0.20Helped
replace the demonstration transformer with a standard Transformer (ablation)DDT · VPAM, multi-map without obstacles, unseen mapssuccess rateHurt
remove the OSIL reward and train with only the ending reward (ablation)DDT · VPAM, multi-map without obstacles, unseen mapslearning efficiencyHurt
increase the number of demonstrationsDDT · VPAM, multi-map with obstacles, unseen mapssuccess rateHelped
increase the model parametersDDT · VPAM, multi-map with obstacles, unseen mapssuccess rate: approximately 2× performance improvementHelped

Surprising findings

Limitations

Experimental setup

Datasets: Valet Parking Assist in Maze (VPAM) demonstrations Meta-World demonstrations Gymnasium Reacher and Pusher Complex planning robot manipulation task (Pang et al., 2023)

Benchmarks: Valet Parking Assist in Maze (VPAM) Meta-World Gymnasium Reacher and Pusher complex planning robot manipulation partially observable VPAM

Metrics: success rate performance degradation under unforeseen obstacles

Baselines: DCRL Trans4OSIL CbMRL Nearest-neighbor replay (Johns 2021; Valassakis 2022)

Builds on: Soft Actor-Critic context-based meta-RL Transformer one-shot imitation learning

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy