Generative Modeling by Minimizing the Wasserstein-2 Loss

Abstract. This paper develops a generative model by minimizing the second-order Wasserstein loss (the [Formula: see text] 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 [Formula: see text] 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 [Formula: see text] 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.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Mathematics of Data Science
Published
2026-09-10
DOI
https://doi.org/10.1137/24m167559x
Primary Topic
Cell Image Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generative Modeling by Minimizing the Wasserstein-2 Loss

Yu‐Jui Huang, Zachariah Malik
SIAM Journal on Mathematics of Data Science
Cell Image Analysis Techniques
article

Generative Modeling by Minimizing the Wasserstein-2 Loss

Yu‐Jui Huang, Zachariah Malik
article en

Abstract

Abstract. This paper develops a generative model by minimizing the second-order Wasserstein loss (the [Formula: see text] 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 [Formula: see text] 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 [Formula: see text] 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.

SIAM Journal on Mathematics of Data ScienceVol. 8(3)
University of Colorado Boulder (US)
National Science Foundation
Openalex Percentile: Top 100%
Cell Image Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.