Align Your Intents: Offline Imitation Learning via Optimal Transport

Maksim Bobrin, Nazar Buzun, Dmitrii Krylov, Dmitry V. Dylov
2/20/2024
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Offline Reinforcement Learning (RL) addresses the problem of sequential decision-making by learning optimal policy through pre-collected data, without interacting with the environment. As yet, it has remained somewhat impractical, because one rarely knows the reward explicitly and it is hard to distill it retrospectively. Here, we show that an imitating agent can still learn the desired behavior merely from observing the expert, despite the absence of explicit rewards or action labels. In our method, AILOT (Aligned Imitation Learning via Optimal Transport), we involve special representation of states in a form of intents that incorporate pairwise spatial distances within the data. Given such representations, we define intrinsic reward function via optimal transport distance between the expert's and the agent's trajectories. We report that AILOT outperforms state-of-the art offline imitation learning algorithms on D4RL benchmarks and improves the performance of other offline RL algorithms by dense reward relabelling in the sparse-reward tasks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{bobrin2024align,
  title  = {Align Your Intents: Offline Imitation Learning via Optimal Transport},
  author = {Maksim Bobrin and Nazar Buzun and Dmitrii Krylov and Dmitry V. Dylov},
  year   = {2024},
  eprint = {2402.13037},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.13037v2}
}

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/2402.13037.svg)](https://codeofpaper.com/paper/2402.13037)

Discussion