Neural Optimal Transport

Alexander Korotin, Daniil Selikhanovych, Evgeny Burnaev

Keywords: weak optimal transport, neural networks

TL;DR: We present a novel neural-networks-based algorithm to compute optimal transport maps and plans for strong and weak transport costs.

Abstract: We present a novel neural-networks-based algorithm to compute optimal transport maps and plans for strong and weak transport costs. To justify the usage of neural networks, we prove that they are universal approximators of transport plans between probability distributions. We evaluate the performance of our optimal transport algorithm on toy examples and on the unpaired image-to-image translation.

Anonymous Url: I certify that there is no URL (e.g., github page) that could be used to find authors’ identity.

No Acknowledgement Section: I certify that there is no acknowledgement section in this submission for double blind review.

Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics

Submission Guidelines: Yes

Please Choose The Closest Area That Your Submission Falls Into: Generative models

Community Implementations: [ 5 code implementations](https://www.catalyzex.com/paper/arxiv:2201.12220/code)