Kernel Neural Optimal Transport

05/30/2022
by   Alexander Korotin, et al.
0

We study the Neural Optimal Transport (NOT) algorithm which uses the general optimal transport formulation and learns stochastic transport plans. We show that NOT with the weak quadratic cost might learn fake plans which are not optimal. To resolve this issue, we introduce kernel weak quadratic costs. We show that they provide improved theoretical guarantees and practical performance. We test NOT with kernel costs on the unpaired image-to-image translation task.

READ FULL TEXT

page 1

page 14

page 22

page 25

page 26

page 27

page 29

page 31

research
01/28/2022

Neural Optimal Transport

We present a novel neural-networks-based algorithm to compute optimal tr...
research
03/09/2019

Stochastic Incremental Algorithms for Optimal Transport with SON Regularizer

We introduce a new regularizer for optimal transport (OT) which is tailo...
research
02/20/2020

The Directional Optimal Transport

We introduce a constrained optimal transport problem where origins x can...
research
04/12/2023

Energy-guided Entropic Neural Optimal Transport

Energy-Based Models (EBMs) are known in the Machine Learning community f...
research
05/10/2019

Inverse optimal transport

Discrete optimal transportation problems arise in various contexts in en...
research
10/21/2019

Geometry of Graph Partitions via Optimal Transport

We define a distance metric between partitions of a graph using machiner...
research
06/07/2020

Adversarial Optimal Transport Through The Convolution Of Kernels With Evolving Measures

A novel algorithm is proposed to solve the sample-based optimal transpor...

Please sign up or login with your details

Forgot password? Click here to reset