English

Quadratically Regularized Optimal Transport: Localization Bounds and Affine Case Analysis

Optimization and Control 2026-05-27 v2 Machine Learning

Abstract

Quadratic regularization has emerged as a potential alternative to the popular entropic regularization in computational optimal transport, offering the theoretical advantage of producing sparse couplings through its hinge density structure. Despite recent progress in one-dimensional settings and general upper bounds, fundamental questions about the localization rate of QOT optimizers around the Monge coupling have remained open. In this work, we establish a general lower bound showing that the support of the QOT optimizer cannot concentrate around the Monge graph faster than order ε1d+2\varepsilon^{\frac{1}{d+2}} in the directed Hausdorff distance, matching the conjectured optimal exponent under standard regularity assumptions in \citet{wiesel2025sparsity}. We also show that the QOT value gap controls the mean-squared deviation EπεyT(x)2\mathbb E_{\pi_\varepsilon}\|y-T(x)\|^2 by the scale of ε2d+2\varepsilon^{\frac{2}{d+2}}. As a corollary, in the affine Brenier regime, which includes Gaussian-to-Gaussian transport, we derive a sharp pointwise tube bound of order ε1d+2\varepsilon^{\frac{1}{d+2}} by reducing the problem to self-transport and applying recent self-transport sparsity results. Finally, we validate our theoretical bound with a synthetic experiment in high-dimensional settings.

Keywords

Cite

@article{arxiv.2605.24644,
  title  = {Quadratically Regularized Optimal Transport: Localization Bounds and Affine Case Analysis},
  author = {Long Nguyen-Chi and Nam Nguyen and Binh Nguyen},
  journal= {arXiv preprint arXiv:2605.24644},
  year   = {2026}
}