Offline Imitation from Observation via Primal Wasserstein State Occupancy Matching
Kai Yan, Alexander G. Schwing, Yu-Xiong Wang
Abstract
In real-world scenarios, arbitrary interactions with the environment can often be costly, and actions of expert demonstrations are not always available. To reduce the need for both, offline Learning from Observations (LfO) is extensively studied: the agent learns to solve a task given only expert states and task-agnostic non-expert state-action pairs. The state-of-the-art DIstribution Correction Estimation (DICE) methods, as exemplified by SMODICE, minimize the state occupancy divergence between the learner's and empirical expert policies. However, such methods are limited to either -divergences (KL and ) or Wasserstein distance with Rubinstein duality, the latter of which constrains the underlying distance metric crucial to the performance of Wasserstein-based solutions. To enable more flexible distance metrics, we propose Primal Wasserstein DICE (PW-DICE). It minimizes the primal Wasserstein distance between the learner and expert state occupancies and leverages a contrastively learned distance metric. Theoretically, our framework is a generalization of SMODICE, and is the first work that unifies -divergence and Wasserstein minimization. Empirically, we find that PW-DICE improves upon several state-of-the-art methods. The code is available at https://github.com/KaiYan289/PW-DICE.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a8bd0f39-929e-4c5c-8cc7-d446e2dba8d6Cited by top-tier papers2
- IOSTOM: Offline Imitation Learning from Observations via State Transition Occupancy MatchingQuang Anh Pham, Janaka Chathuranga Brahmanage, Tien Mai, Akshat KumarNeurIPS 2025 · 2 citations
- Latent Wasserstein Adversarial Imitation LearningSiqi Yang, Kai Yan, Alex Schwing, Yu-Xiong WangICLR 2026 · 1 citation
Builds on19
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- Conservative Q-Learning for Offline Reinforcement LearningAviral Kumar, Aurick Zhou, George Tucker, Sergey LevineNeurIPS 2020 · 2,881 citations
- Decision Transformer: Reinforcement Learning via Sequence ModelingLili Chen, Kevin Lu, Aravind Rajeswaran, Kimin Lee et al.NeurIPS 2021 · 2,557 citations
- Offline Reinforcement Learning with Implicit Q-LearningIlya Kostrikov, Ashvin Nair, Sergey LevineICLR 2022 · 1,402 citations
- CURL: Contrastive Unsupervised Representations for Reinforcement LearningMichael Laskin, Aravind Srinivas, Pieter AbbeelICML 2020 · 1,261 citations
Related papers
- Versatile Offline Imitation from Observations and Examples via Regularized State-Occupancy MatchingYecheng Jason Ma, Andrew Shen, Dinesh Jayaraman, Osbert BastaniICML 2022 · 49 citations
- Relaxed Stationary Distribution Correction Estimation for Improved Offline Policy OptimizationWoosung Kim, Donghyeon Ki, Byung-Jun LeeAAAI 2024 · 4 citations
- Revisiting Distribution Correction Estimation for Offline Imitation Learning with Suboptimal DatasetQuang Anh PHAM, Tien Mai, Akshat KumarICML 2026
- LobsDICE: Offline Learning from Observation via Stationary Distribution Correction EstimationGeon-Hyeong Kim, Jongmin Lee, Youngsoo Jang, Hongseok Yang et al.NeurIPS 2022 · 33 citations
- A Simple Solution for Offline Imitation from Observations and Examples with Possibly Incomplete TrajectoriesKai Yan, Alexander G. Schwing, Yu-Xiong WangNeurIPS 2023 · 7 citations
