Zero-Shot Offline Imitation Learning via Optimal Transport

Thomas Rupf, M. Bagatella, Nico Gürtler, Jonas Frey, Georg Martius
2/12/2026

No official code found. Best implementation: martius-lab/zilot (10 stars, MIT, last commit 2025-02-05).

Abstract

Zero-shot imitation learning algorithms hold the promise of reproducing unseen behavior from as little as a single demonstration at test time. Existing practical approaches view the expert demonstration as a sequence of goals, enabling imitation with a high-level goal selector, and a low-level goal-conditioned policy. However, this framework can suffer from myopic behavior: the agent's immediate actions towards achieving individual goals may undermine long-term objectives. We introduce a novel method that mitigates this issue by directly optimizing the occupancy matching objective that is intrinsic to imitation learning. We propose to lift a goal-conditioned value function to a distance between occupancies, which are in turn approximated via a learned world model. The resulting method can learn from offline, suboptimal data, and is capable of non-myopic, zero-shot imitation, as we demonstrate in complex, continuous benchmarks. The code is available at https://github.com/martius-lab/zilot.

View on arXivView PDF

Code Implementations(1)

martius-lab/zilotCommunity100%
MIT

Code for Paper: Zero-Shot Offline Imitation Learning via Optimal Transport

101Shell, PythonOct 10, 20241 years agoMIT

Similar Papers

Cite this paper

@article{rupf2026zeroshot,
  title  = {Zero-Shot Offline Imitation Learning via Optimal Transport},
  author = {Thomas Rupf and M. Bagatella and Nico Gürtler and Jonas Frey and Georg Martius},
  year   = {2026},
  eprint = {2410.08751},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2410.08751},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.08751.svg)](https://codeofpaper.com/paper/2410.08751)

Discussion