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

Abstract

We study the quadratically regularized optimal transport (QOT) problem for quadratic cost and compactly supported marginals μ and . 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 μ= we obtain optimal rates of order ε12+d.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…