Wasserstein mirror gradient flow as the limit of the Sinkhorn algorithm

We prove that the sequence of marginals obtained from the iterations of the Sinkhorn algorithm or the iterative proportional fitting procedure (IPFP) on joint densities, converges to an absolutely continuous curve on the 2-Wasserstein space, as the regularization parameter ε goes to zero and the number of iterations is scaled as 1/ε (and other technical assumptions). This limit, which we call the Sinkhorn flow, is an example of a Wasserstein mirror gradient flow, a concept we introduce here inspired by the well-known Euclidean mirror gradient flows. In the case of Sinkhorn, the gradient is that of the relative entropy functional with respect to one of the marginals, and the mirror is half of the squared Wasserstein distance functional from the other marginal. Interestingly, the norm of the velocity field of this flow can be interpreted as the metric derivative with respect to the linearized optimal transport (LOT) distance. An equivalent description of this flow is provided by the parabolic Monge–Ampère PDE whose connection to the Sinkhorn algorithm was noticed by Berman (Numer. Math. 145 (2020) 771–836). We derive conditions for exponential convergence for this limiting flow. We also construct a McKean–Vlasov diffusion whose marginal distributions follow the Sinkhorn flow.

Authors

Institutions

Publication Details

Journal
The Annals of Probability
Published
2026-08-28
DOI
https://doi.org/10.1214/25-aop1801
Primary Topic
Advanced Neuroimaging Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Wasserstein mirror gradient flow as the limit of the Sinkhorn algorithm

Geoffrey Schiebinger, Nabarun Deb, Young‐Heon Kim, Soumik Pal
The Annals of Probability
Advanced Neuroimaging Techniques and Applications
article

Wasserstein mirror gradient flow as the limit of the Sinkhorn algorithm

Geoffrey Schiebinger, Nabarun Deb, Young‐Heon Kim, Soumik Pal
article en

Abstract

We prove that the sequence of marginals obtained from the iterations of the Sinkhorn algorithm or the iterative proportional fitting procedure (IPFP) on joint densities, converges to an absolutely continuous curve on the 2-Wasserstein space, as the regularization parameter ε goes to zero and the number of iterations is scaled as 1/ε (and other technical assumptions). This limit, which we call the Sinkhorn flow, is an example of a Wasserstein mirror gradient flow, a concept we introduce here inspired by the well-known Euclidean mirror gradient flows. In the case of Sinkhorn, the gradient is that of the relative entropy functional with respect to one of the marginals, and the mirror is half of the squared Wasserstein distance functional from the other marginal. Interestingly, the norm of the velocity field of this flow can be interpreted as the metric derivative with respect to the linearized optimal transport (LOT) distance. An equivalent description of this flow is provided by the parabolic Monge–Ampère PDE whose connection to the Sinkhorn algorithm was noticed by Berman (Numer. Math. 145 (2020) 771–836). We derive conditions for exponential convergence for this limiting flow. We also construct a McKean–Vlasov diffusion whose marginal distributions follow the Sinkhorn flow.

The Annals of ProbabilityVol. 54(5)
University of British Columbia (CA), University of Washington (US), Cambridge Econometrics (United Kingdom) (GB)
National Science Foundation, Menzies School of Health Research, Canadian Institutes of Health Research, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 100%
Advanced Neuroimaging Techniques and Applications
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.