paper-with-me

홈 › Papers

Quadratically Regularized Optimal Transport: Localization Bounds and Affine Case Analysis

2026-05-23 · Long Nguyen-Chi, Nam Nguyen, Binh Nguyen arxiv

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 $\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 $\mathbb E_{π_\varepsilon}\|y-T(x)\|^2$ by the scale of $\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 $\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.

📄 PDF Abstract BibTeX arXiv:2605.24644

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Nearly Tight Convergence Bounds for Semi-discrete Entropic Optimal Transport

2021-10-25 · Alex Delalande

We derive nearly tight and non-asymptotic convergence bounds for solutions of entropic semi-discrete optimal transport. These bounds quantify the stability of the dual solutions of the regularized problem (sometimes call…

Sparsity-Constrained Optimal Transport

2022-09-30 · Tianlin Liu, Joan Puigcerver, Mathieu Blondel

Regularized optimal transport (OT) is now increasingly used as a loss or as a matching layer in neural networks. Entropy-regularized OT can be computed using the Sinkhorn algorithm but it leads to fully-dense transportat…

Mixture-of-Experts

Quadratically Regularized Optimal Transport: nearly optimal potentials and convergence of discrete Laplace operators

2022-11-20 · Gilles Mordant, Stephen Zhang

We consider the conjecture proposed in Matsumoto, Zhang and Schiebinger (2022) suggesting that optimal transport with quadratic regularisation can be used to construct a graph whose discrete Laplace operator converges to…

Entropy Regularized Optimal Transport Independence Criterion

2021-12-31 · Lang Liu, Soumik Pal, Zaid Harchaoui

We introduce an independence criterion based on entropy regularized optimal transport. Our criterion can be used to test for independence between two samples. We establish non-asymptotic bounds for our test statistic and…

Non-Coherent Sensor Fusion via Entropy Regularized Optimal Mass Transport

2018-11-19

This work presents a method for information fusion in source localization applications. The method utilizes the concept of optimal mass transport in order to construct estimates of the spatial spectrum using a convex bar…

Sensor Fusion