Generative Modeling by Minimizing the Wasserstein-2 Loss
Not on the map. Why?
Abstract (arXiv)
This paper develops a generative model by minimizing the second-order Wasserstein loss (the W2 loss) through a distribution-dependent ordinary differential equation (ODE), whose dynamics involves the Kantorovich potential associated with the true data distribution and a current estimate of it. A main result shows that the time-marginal laws of the ODE form a gradient flow for the W2 loss, which converges exponentially to the true data distribution. An Euler scheme for the ODE is proposed and it is shown to recover the gradient flow for the W2 loss in the limit. An algorithm is designed by following the scheme and applying persistent training, which naturally fits our gradient-flow approach. In both low- and high-dimensional experiments, our algorithm outperforms Wasserstein generative adversarial networks by increasing the level of persistent training appropriately.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 12 of its 26 references that are in the map. First posted on arXiv 19 Jun 2024.
Builds on
12 of 26 references.
References · 12
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 506
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2016NIPS 2016 Tutorial: Generative Adversarial Networkscited by 285
- 2016Unrolled Generative Adversarial Networkscited by 208
- 2019Optimal transport mapping via input convex neural networkscited by 206
- 2017Large-Scale Optimal Transport and Mapping Estimationcited by 123
- 2021Generative Modeling with Optimal Transport Mapscited by 82
- 2017On the regularization of Wasserstein GANscited by 65
- 2019Adversarial Computation of Optimal Transport Mapscited by 12
- 2021Hierarchical Optimal Transport for Unsupervised Domain Adaptationcited by 10
- 2022GANs as Gradient Flows that Convergecited by 5
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.