Neural Optimal Transport

01/28/2022
by   Alexander Korotin, et al.
0

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 style translation task.

READ FULL TEXT

page 8

page 15

page 16

page 17

page 18

page 19

page 20

page 22

research
05/30/2022

Neural Optimal Transport with General Cost Functionals

We present a novel neural-networks-based algorithm to compute optimal tr...
research
05/30/2022

Kernel Neural Optimal Transport

We study the Neural Optimal Transport (NOT) algorithm which uses the gen...
research
06/07/2021

Scalable Computation of Monge Maps with General Costs

Monge map refers to the optimal transport map between two probability di...
research
08/28/2019

Optimal transport mapping via input convex neural networks

In this paper, we present a novel and principled approach to learn the o...
research
03/09/2020

COPT: Coordinated Optimal Transport on Graphs

We introduce COPT, a novel distance metric between graphs defined via an...
research
08/04/2019

Learning to Transport with Neural Networks

We compare several approaches to learn an Optimal Map, represented as a ...
research
07/17/2023

Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients

We design a novel algorithm for optimal transport by drawing from the en...

Please sign up or login with your details

Forgot password? Click here to reset