OT-Net: A Reusable Neural Optimal Transport Solver

Zezeng Li, Shenghao Li, Lianbao Jin, Na Lei, Zhongxuan Luo
6/14/2023
cs.CV

No confident code implementation found for this paper.

Abstract

With the widespread application of optimal transport (OT), its calculation becomes essential, and various algorithms have emerged. However, the existing methods either have low efficiency or cannot represent discontinuous maps. A novel reusable neural OT solver OT-Net is thus presented, which first learns Brenier's height representation via the neural network to obtain its potential, and then gained the OT map by computing the gradient of the potential. The algorithm has two merits, 1) it can easily represent discontinuous maps, which allows it to match any target distribution with discontinuous supports and achieve sharp boundaries. This can well eliminate mode collapse in the generated models. 2) The OT map can be calculated straightly by the proposed algorithm when new target samples are added, which greatly improves the efficiency and reusability of the map. Moreover, the theoretical error bound of the algorithm is analyzed, and we have demonstrated the empirical success of our approach in image generation, color transfer, and domain adaptation.

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{li2023otnet,
  title  = {OT-Net: A Reusable Neural Optimal Transport Solver},
  author = {Zezeng Li and Shenghao Li and Lianbao Jin and Na Lei and Zhongxuan Luo},
  year   = {2023},
  eprint = {2306.08233},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.08233v2}
}

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

Discussion