Sharp local sparsity of regularized optimal transport
Alberto Gonz\'alez-Sanz, Rishabh S. Gvalani, Lukas Koch

TL;DR
This paper investigates the local sparsity and convergence rates of entropy-regularized optimal transport solutions, providing sharp geometric and potential convergence results in multivariate settings.
Contribution
It establishes sharp local support size estimates and convergence rates for regularized optimal transport potentials, extending previous results to multivariate and non-self transport cases.
Findings
Supports behave like balls of radius ε^{1/(d(p-1)+2)}
Regularized potentials are uniformly strongly convex
Derived convergence rates of potentials to unregularized limits
Abstract
In recent years, the use of entropy-regularized optimal transport with -type entropies has become increasingly popular. In this setting, the solutions are sparse, in the sense that the support of the regularized optimal coupling, , shrinks to the support of the original optimal transport problem as . The main open question concerns the rate of this convergence. In this paper, we obtain sharp local results away from the boundary. We prove that the supports of the conditional measures, , behave like balls of radius . This allows us to show that the regularized potentials are uniformly strongly convex and to derive the rate of convergence of these potentials toward their unregularized limit. Our results generalize the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
