Scalable Simulation-free Entropic Unbalanced Optimal Transport

Jaemoo Choi, Jaewoong Choi
10/3/2024
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

The Optimal Transport (OT) problem investigates a transport map that connects two distributions while minimizing a given cost function. Finding such a transport map has diverse applications in machine learning, such as generative modeling and image-to-image translation. In this paper, we introduce a scalable and simulation-free approach for solving the Entropic Unbalanced Optimal Transport (EUOT) problem. We derive the dynamical form of this EUOT problem, which is a generalization of the Schrödinger bridges (SB) problem. Based on this, we derive dual formulation and optimality conditions of the EUOT problem from the stochastic optimal control interpretation. By leveraging these properties, we propose a simulation-free algorithm to solve EUOT, called Simulation-free EUOT (SF-EUOT). While existing SB models require expensive simulation costs during training and evaluation, our model achieves simulation-free training and one-step generation by utilizing the reciprocal property. Our model demonstrates significantly improved scalability in generative modeling and image-to-image translation tasks compared to previous SB methods.

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{choi2024scalable,
  title  = {Scalable Simulation-free Entropic Unbalanced Optimal Transport},
  author = {Jaemoo Choi and Jaewoong Choi},
  year   = {2024},
  eprint = {2410.02656},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.02656v2}
}

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

Discussion