Back to Search
Start Over
Sparsity of Quadratically Regularized Optimal Transport: Bounds on concentration and bias
- Publication Year :
- 2024
-
Abstract
- We study the quadratically regularized optimal transport (QOT) problem for quadratic cost and compactly supported marginals $\mu$ and $\nu$. It has been empirically observed that the optimal coupling $\pi_\epsilon$ for the QOT problem has sparse support for small regularization parameter $\epsilon>0.$ In this article we provide the first quantitative description of this phenomenon in general dimension: we derive bounds on the size and on the location of the support of $\pi_\epsilon$ compared to the Monge coupling. Our analysis is based on pointwise bounds on the density of $\pi_\epsilon$ together with Minty's trick, which provides a quadratic detachment from the optimal transport duality gap. In the self-transport setting $\mu=\nu$ we obtain optimal rates of order $\epsilon^{\frac{1}{2+d}}.$
- Subjects :
- Mathematics - Optimization and Control
Mathematics - Probability
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2410.03425
- Document Type :
- Working Paper