Sparsity of Quadratically Regularized Optimal Transport: Scalar Case
Abstract: The quadratically regularized optimal transport problem is empirically known to have sparse solutions: its optimal coupling $\pi_{\varepsilon}$ has sparse support for small regularization parameter $\varepsilon$, in contrast to entropic regularization whose solutions have full support for any $\varepsilon>0$. Focusing on continuous and scalar marginals, we provide the first precise description of this sparsity. Namely, we show that the support of $\pi_{\varepsilon}$ shrinks to the Monge graph at the sharp rate $\varepsilon{1/3}$. This result is based on a detailed analysis of the dual potential $f_{\varepsilon}$ for small $\varepsilon$. In particular, we prove that $f_{\varepsilon}$ is twice differentiable a.s. and bound the second derivative uniformly in $\varepsilon$, showing that $f_{\varepsilon}$ is uniformly strongly convex. Convergence rates for $f_{\varepsilon}$ and its derivative are also obtained.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.