mlsanityData to 14 Oct 2026

Sparsity of Quadratically Regularized Optimal Transport: Bounds on concentration and bias

arXiv 2410.03425 ↗First posted 4 Oct 2024math.OC math.PRcited by 3

Not on the map. Why?

Abstract (arXiv)

We study the quadratically regularized optimal transport (QOT) problem for quadratic cost and compactly supported marginals μ and nu. It has been empirically observed that the optimal coupling πε for the QOT problem has sparse support for small regularization parameter ε>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 πε compared to the Monge coupling. Our analysis is based on pointwise bounds on the density of πε together with Minty's trick, which provides a quadratic detachment from the optimal transport duality gap. In the self-transport setting μ=nu we obtain optimal rates of order ε^frac12+d.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 Oct 2024.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.