Quadratically Regularized Optimal Transport: Localization Bounds and Affine Case Analysis
Long Nguyen-Chi, Nam Nguyen, Binh T. Nguyen
摘要
Quadratically 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 setting 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 in the directed Hausdorff distance, matching the conjectured optimal exponent under standard regularity assumptions in Wiesel & Xu (2025). We also show that the QOT value gap controls the mean-squared deviation by the scale of . As a corollary, in the affine Brenier regime, which includes Gaussian-to-Gaussian transport, we derive a sharp pointwise tube bound of order by reducing the problem to self-transport and applying recent self-transport sparsity results. Finally, we validate our theoretical bound with synthetic experiment in high dimensions setting.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
相关 Paper
- Sparsity-Constrained Optimal TransportTianlin Liu, Joan Puigcerver, Mathieu BlondelICLR 2023 · 被引用 3 次
- The Monge Gap: A Regularizer to Learn All Transport MapsThéo Uscidda, Marco CuturiICML 2023 · 被引用 40 次
- A Truncated Newton Method for Optimal TransportMete Kemertas, Amir-massoud Farahmand, Allan Douglas JepsonICLR 2025
- Monge, Bregman and Occam: Interpretable Optimal Transport in High-Dimensions with Feature-Sparse MapsMarco Cuturi, Michal Klein, Pierre AblinICML 2023 · 被引用 19 次
- Progressive Entropic Optimal Transport SolversParnian Kassraie, Aram-Alexandre Pooladian, Michal Klein, James Thornton 等NeurIPS 2024 · 被引用 14 次
