Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithm
Not on the map. Why?
Abstract (arXiv)
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 varepsilon goes to zero and the number of iterations is scaled as 1/varepsilon (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`ere PDE whose connection to the Sinkhorn algorithm was noticed by Berman (2020). We derive conditions for exponential convergence for this limiting flow. We also construct a Mckean-Vlasov diffusion whose marginal distributions follow the Sinkhorn flow.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 11 of its 43 references that are in the map. First posted on arXiv 31 Jul 2023.
Builds on
11 of 43 references.
References · 11
- 2018Computational Optimal Transportcited by 780
- 2020Linear Optimal Transport Embedding: Provable Wasserstein classification for certain rigid transformations and perturbationscited by 37
- 2021Entropic Optimal Transport: Convergence of Potentialscited by 31
- 2022Trajectory Inference via Mean-field Langevin in Path Spacecited by 30
- 2021Stability of Entropic Optimal Transport and Schr"odinger Bridgescited by 26
- 2020A gradient descent perspective on Sinkhorncited by 24
- 2021Entropic Optimal Transport: Geometry and Large Deviationscited by 20
- 2022Stability of Schr"odinger Potentials and Convergence of Sinkhorn's Algorithmcited by 13
- 2022Convergence Rates for Regularized Optimal Transport via Quantizationcited by 12
- 2021Quantitative Uniform Stability of the Iterative Proportional Fitting Procedurecited by 11
- 2022Convergence rate of general entropic optimal transport costscited by 9
Built on by
Citing papers per year: 2023: 2; 2024: 4; 2025: 3; 2026: 1.
10 papers.
- 2024Mirror and Preconditioned Gradient Descent in Wasserstein Spacecited by 12
- 2024A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithmcited by 4
- 2024Trade-off Between Dependence and Complexity for Nonparametric Learning -- an Empirical Process Approachcited by 3
- 2025Variational Online Mirror Descent for Robust Learning in Schr"odinger Bridgecited by 2
- 2023Information Geometry for the Working Information Theoristcited by 1
- 2023Sinkhorn Flow: A Continuous-Time Framework for Understanding and Generalizing the Sinkhorn Algorithmcited by 1
- 2026Mirror Langevin diffusions: Convergence rates and Markov chain approximationscited by 1
- 2024Last Iterate Convergence in Monotone Mean Field Gamescited by 0
- 2025Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavitycited by 0
- 2025Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspectivecited by 0
- 2026Mirror Langevin diffusions: Convergence rates and Markov chain approximations24 Jul 2026
- 2025Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective16 Jul 2025
- 2025Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavity15 Apr 2025
- 2025Variational Online Mirror Descent for Robust Learning in Schr"odinger Bridge3 Apr 2025
- 2024A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm12 Dec 2024
- 2024Last Iterate Convergence in Monotone Mean Field Games7 Oct 2024
- 2024Mirror and Preconditioned Gradient Descent in Wasserstein Space13 Jun 2024
- 2024Trade-off Between Dependence and Complexity for Nonparametric Learning -- an Empirical Process Approach17 Jan 2024
- 2023Sinkhorn Flow: A Continuous-Time Framework for Understanding and Generalizing the Sinkhorn Algorithm28 Nov 2023
- 2023Information Geometry for the Working Information Theorist5 Oct 2023