Geometry and Convergence of Quadratically Regularized Optimal Transport I
Alberto González-Sanz, Marcel Nutz
Abstract
We establish sharp convergence rates for quadratically regularized optimal transport with quadratic cost in the regime of small regularization . In particular, we quantify the sparsity of the support of the regularized optimizer. For smooth marginal densities in Rd, this support lies within a distance of order 1/(d+2) from the Brenier graph, and every section of the support is sandwiched between balls with radii of that order. The geometry of the support is closely linked to the dual potentials. We show that the potentials satisfy uniform two-sided Hessian bounds and converge uniformly at rate 2/(d+2), while their gradients converge at rate 1/(d+2). The rates are sharp, and we further identify the regularity threshold where convergence breaks down.
Create a lesson
Related papers
Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates
David Martínez-Rubio, Cristóbal Guzmán
The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings
David Martínez-Rubio, Brian Bullins, Cristóbal Guzmán et al.
Complexity Of Output Feedback Stabilization
Amir Ali Ahmadi, Abraar Chaudhry, Ijay Narang et al.
Convergence rate of the moment-SOS hierarchy for univariate polynomial optimization
Didier Henrion, Mohab Safey El Din
Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems
Julian Niederer, Christoph Hansknecht, Andreas Potschka et al.
Near-Optimal Pure Single-Loop Extragradient Method for Strongly Convex--Strongly Concave Minimax Optimization
Minhao Zhang, Zi Xu