Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavity
By: Giacomo Greco, Luca Tamanini
Potential Business Impact:
Makes computer learning faster and more accurate.
In this paper we determine quantitative stability bounds for the Hessian of entropic potentials, i.e., the dual solution to the entropic optimal transport problem. Up to authors' knowledge this is the first work addressing this second-order quantitative stability estimate in general unbounded settings. Our proof strategy relies on semiconcavity properties of entropic potentials and on the representation of entropic transport plans as laws of forward and backward diffusion processes, known as Schr\"odinger bridges. Moreover, our approach allows to deduce a stochastic proof of quantitative stability entropic estimates and integrated gradient estimates as well. Finally, as a direct consequence of these stability bounds, we deduce exponential convergence rates for gradient and Hessian of Sinkhorn iterates along Sinkhorn's algorithm, a problem that was still open in unbounded settings. Our rates have a polynomial dependence on the regularization parameter.
Similar Papers
On the contraction properties of Sinkhorn semigroups
Probability
Makes computer learning faster and more accurate.
Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective
Optimization and Control
Makes computer math problems solve faster.
Contraction and entropy production in continuous-time Sinkhorn dynamics
Machine Learning (Stat)
Makes AI learn faster and better.