Contraction and entropy production in continuous-time Sinkhorn dynamics
Anand Srinivasan, Jean-Jacques Slotine
TL;DR
The paper addresses contraction and entropy production in continuous-time Sinkhorn dynamics for entropic OT. It develops two time-dependent metrics derived from the mirror Hessian to establish contraction under a coercivity condition, and proves an exact entropy-production rate identity, linking the Sinkhorn flow to Onsager gradient structures and a nonlocal Dirichlet form. Key contributions include a Poincaré inequality with a uniform spectral gap for $\varepsilon>0$, and showing that exponential entropy decay is equivalent to a log-Sobolev inequality, with consequences for convergence guarantees. The results yield practical guidance for latent-space design in generative modeling and provide stopping heuristics for discrete Sinkhorn iterations, enhancing both theory and application of entropic OT methods.
Abstract
Recently, the vanishing-step-size limit of the Sinkhorn algorithm at finite regularization parameter $\varepsilon$ was shown to be a mirror descent in the space of probability measures. We give $L^2$ contraction criteria in two time-dependent metrics induced by the mirror Hessian, which reduce to the coercivity of certain conditional expectation operators. We then give an exact identity for the entropy production rate of the Sinkhorn flow, which was previously known only to be nonpositive. Examining this rate shows that the standard semigroup analysis of diffusion processes extends systematically to the Sinkhorn flow. We show that the flow induces a reversible Markov dynamics on the target marginal as an Onsager gradient flow. We define the Dirichlet form associated to its (nonlocal) infinitesimal generator, prove a Poincaré inequality for it, and show that the spectral gap is strictly positive along the Sinkhorn flow whenever $\varepsilon > 0$. Lastly, we show that the entropy decay is exponential if and only if a logarithmic Sobolev inequality (LSI) holds. We give for illustration two immediate practical use-cases for the Sinkhorn LSI: as a design principle for the latent space in which generative models are trained, and as a stopping heuristic for discrete-time algorithms.
