Peer-reviewedLicence not statedThe Annals of Probability
Wasserstein mirror gradient flow as the limit of the Sinkhorn algorithm
- 1Department of Econometrics and Statistics, University of Chicago
- 2Department of Mathematics, University of British Columbia
- 3Department of Mathematics, University of Washington
Related
- Averaged Mirror Descent and Dual Gradient Methods: Convergent Algorithms for Entropic Gromov-Wasserstein Problems
- Exponential Convergence of the Sinkhorn Algorithm for the Schrödinger Bridge with Regime Switching
- Exponential convergence of Sinkhorn algorithm for entropy martingale optimal transport
- A Provably Convergent and Practical Algorithm for Gromov--Wasserstein Optimal Transport
- Control Strategies for Multi-Species Wasserstein Gradient Flows
BibTeX
@article{deb2026wasserstein,
title = {{Wasserstein mirror gradient flow as the limit of the Sinkhorn algorithm}},
author = {Nabarun Deb and Young‐Heon Kim and Soumik Pal and Geoffrey R. Schiebinger},
journal = {The Annals of Probability},
year = {2026},
month = aug,
doi = {10.1214/25-aop1801},
url = {https://arxiv.org/abs/2307.16421},
}
RIS
TY - JOUR
TI - Wasserstein mirror gradient flow as the limit of the Sinkhorn algorithm
AU - Nabarun Deb
AU - Young‐Heon Kim
AU - Soumik Pal
AU - Geoffrey R. Schiebinger
PY - 2026
DA - 2026/08/28
JO - The Annals of Probability
DO - 10.1214/25-aop1801
UR - https://arxiv.org/abs/2307.16421
SN - 0091-1798
SN - 2168-894X
ER -