mlsanityData to 7 Oct 2026

Thermodynamic structure of the Sinkhorn flow

arXiv 2510.12639 ↗First posted 14 Oct 2025stat.ML cs.LG math.PRcited by 0

Not on the map. Why?

Abstract (arXiv)

Entropy-regularized optimal transport, which has strong links to the Schr"odinger bridge problem in statistical mechanics, enjoys a variety of applications from trajectory inference to generative modeling. A major driver of renewed interest in this problem is the recent development of fast matrix-scaling algorithmstextemdash known as iterative proportional fitting or the Sinkhorn algorithmtextemdash for entropic optimal transport, which have favorable complexity over traditional approaches to the unregularized problem. Here, we take a perspective on this algorithm rooted in the thermodynamic origins of Schr"odinger's problem and inspired by the modern geometric theory of diffusion: is the Sinkhorn flow (viewed in continuous-time as a mirror descent by recent results) the gradient flow of entropy in a formal Riemannian geometry? We answer this question affirmatively, finding a nonlocal Wasserstein gradient structure in the dynamics of its free marginal. This offers a physical interpretation of the Sinkhorn flow as the stochastic dynamics of a particle with law evolving by the nonlocal diffusion of a chemical potential. Simultaneously, it brings a standard suite of functional inequalities characterizing Markov diffusion processes to bear upon its geometry and convergence. We prove an entropy-energy (de Bruijn) identity, a Poincar'e inequality, and a Bakry-'Emery-type condition under which a logarithmic Sobolev inequality (LSI) holds and implies exponential convergence of the Sinkhorn flow in entropy. We lastly discuss computational applications such as stopping heuristics and latent-space design criteria leveraging the LSI and, returning to the physical interpretation, the possibility of natural systems whose relaxation to equilibrium inherently solves entropic optimal transport or Schr"odinger bridge problems.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 45 references that are in the map. First posted on arXiv 14 Oct 2025.

Builds on

12 of 45 references.

References · 12

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 897
  3. 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
  4. 2017Learning Generative Models with Sinkhorn Divergencescited by 310
  5. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
  6. 2021Sinkformers: Transformers with Doubly Stochastic Attentioncited by 136
  7. 2022Mirror Descent with Relative Smoothness in Measure Spaces, with application to Sinkhorn and EMcited by 33
  8. 2020Mirrorless Mirror Descent: A Natural Derivation of Mirror Descentcited by 18
  9. 2018Beyond Convexity -- Contraction and Global Convergence of Gradient Descentcited by 17
  10. 2023Projected Langevin dynamics and a gradient flow for entropic optimal transportcited by 17
  11. 2023Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginalscited by 13
  12. 2023Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithmcited by 8

Built on by

Not cited yet.