Adversarial Computation of Optimal Transport Maps
read the original abstract
Computing optimal transport maps between high-dimensional and continuous distributions is a challenging problem in optimal transport (OT). Generative adversarial networks (GANs) are powerful generative models which have been successfully applied to learn maps across high-dimensional domains. However, little is known about the nature of the map learned with a GAN objective. To address this problem, we propose a generative adversarial model in which the discriminator's objective is the $2$-Wasserstein metric. We show that during training, our generator follows the $W_2$-geodesic between the initial and the target distributions. As a consequence, it reproduces an optimal map at the end of training. We validate our approach empirically in both low-dimensional and high-dimensional continuous settings, and show that it outperforms prior methods on image data.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Learning Monge maps with constrained drifting models
A new constrained gradient flow on the space of transport maps converges to the OT map and enables more stable and accurate training of convexity-constrained neural networks for learning Monge maps.
-
Generative Modeling by Minimizing the Wasserstein-2 Loss
Minimizing the W2 loss through a distribution-dependent ODE whose time-marginals form an exponentially convergent gradient flow, discretized via Euler scheme with persistent training that outperforms WGANs in experiments.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.