aiqbench analysis
This research introduces a novel generative modeling framework that minimizes the Wasserstein-2 loss via distribution-dependent ordinary differential equations, achieving exponential convergence to the true data distribution. By implementing persistent training within this gradient flow approach, the proposed algorithm demonstrates superior performance over existing Wasserstein GANs in both low- and high-dimensional experiments. The work advances theoretical understanding of generative dynamics while offering a practical alternative for improving sample quality in complex data distributions.
Generative Modeling by Minimizing the Wasserstein-2 Loss
arXiv:2406.13619v5 Announce Type: replace-cross Abstract: This paper develops a generative model by minimizing the second-order Wasserstein loss (the $W_2$ 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 $W_2$ 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 $W_2$ 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.
Abstract:This paper develops a generative model by minimizing the second-order Wasserstein loss (the $W_2$ 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 $W_2$ 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 $W_2$ 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.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2406.13619 [stat.ML]
(or arXiv:2406.13619v5 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2406.13619 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 225 words
Related coverage
Fine-Tuning Generative Models for Extreme Events via CVaR-Penalized Wasserstein Gradient Flows
arXiv · Oct 5, 2026

Gray-codes help quantum machine learning grasp numbers faster
Quantum Zeitgeist · Oct 14, 2026

Projection sampling preserves capabilities but diminishes gains from alignment fine-tuning
LessWrong · Oct 16, 2026
Neural Scaling Laws for Jet Generation
arXiv · Oct 7, 2026