Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

Entropic Neural Optimal Transport via Diffusion Processes

About

We propose a novel neural algorithm for the fundamental problem of computing the entropic optimal transport (EOT) plan between continuous probability distributions which are accessible by samples. Our algorithm is based on the saddle point reformulation of the dynamic version of EOT which is known as the Schr\"odinger Bridge problem. In contrast to the prior methods for large-scale EOT, our algorithm is end-to-end and consists of a single learning step, has fast inference procedure, and allows handling small values of the entropy regularization coefficient which is of particular importance in some applied problems. Empirically, we show the performance of the method on several large-scale EOT tasks. https://github.com/ngushchin/EntropicNeuralOptimalTransport

Nikita Gushchin, Alexander Kolesov, Alexander Korotin, Dmitry Vetrov, Evgeny Burnaev• 2022

Related benchmarks

TaskDatasetResultRank
Target Distribution FittingHigh-dimensional Gaussian
BW2^2-UVP1
28
Marginal Distribution Recovery16D Gaussian (test)
BW2-UVP (t=0)0.00e+0
7
EOT plan recoveryGaussian Dim 2
BW2-UVP1.2
7
EOT plan recoveryGaussian Dim 16
BW2-UVP5
7
EOT plan recoveryGaussian Dim 64
BW2-UVP13
7
EOT plan recoveryGaussian Dim 128
BW2-UVP29
7
Unpaired Super-ResolutionCelebA faces (test)
FID3.78
6
Optimal TransportContinuous Wasserstein-2 (W2) benchmark
Early Stage Value0.77
3
Showing 8 of 8 rows

Other info

Code

Follow for update