Planning / Methods
verifiedImitation Learning
Rather than specify a reward, show the behaviour you want and have the model copy it. It sidesteps reward design entirely, which is the hardest part of reinforcement learning in practice. The weakness appears the moment the learner drifts somewhere the expert never went — it has no demonstration for the situation its own mistake created.
Behaviour cloning is supervised learning on state-action pairs, and its errors compound quadratically in the episode length because each mistake moves the learner further off the expert's distribution. The fixes either collect corrective data where the learner actually goes, or match distributions rather than actions — which is what adversarial imitation does, treating the discriminator's output as a learned reward.
With a per-step error ε under the expert's state distribution, behaviour cloning's regret over an episode of length T grows as roughly ε·T² rather than ε·T, because errors move the state distribution as well as the action. Distribution-matching methods target that directly, minimising a divergence between occupancy measures rather than a loss on individual actions.
Loss over 2000 training steps, starting near 7.2. It falls to about 1.95, with 93% of the total improvement arriving in the first half. A second line shows held-out, ending higher at about 2.22.
Loss on the expert's own states against loss on the states the learner drifts into. Drag the drift up to watch the second curve leave the first — every demonstration is on the first distribution and none is on the second.
Reviewed by opendroid · 2026-08-18
- arXiv:1606.03476 — Generative Adversarial Imitation Learning