REVIEW 2 cited by
Orlicz-space regularization for optimal transport and algorithms for quadratic regularization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Orlicz-space regularization for optimal transport and algorithms for quadratic regularization
read the original abstract
We investigate the continuous optimal transport problem in the so-called Kantorovich form, i.e. given two Radon measures on two compact sets, we seek an optimal transport plan which is another Radon measure on the product of the sets that has these two measures as marginals and minimizes a certain cost function. We consider regularization of the problem with so-called Young's functions, which forces the optimal transport plan to be a function in the corresponding Orlicz space rather than a Radon measure. We derive the predual problem and show strong duality and existence of primal solutions to the regularized problem. Existence of (pre-)dual solutions will be shown for the special case of $L^p$ regularization for $p\geq2$. Then we derive four algorithms to solve the dual problem of the quadratically regularized problem: A cyclic projection method, a dual gradient decent, a simple fixed point method, and Nesterov's accelerated gradient, all of which have a very low cost per iteration.
Forward citations
Cited by 2 Pith papers
-
Linear Convergence of Gradient Descent for Quadratically Regularized Optimal Transport
Establishes linear L2 convergence of dual gradient descent for quadratically regularized OT via spectral analysis showing the linearized operator is a strict contraction.
-
Polyak-Lojasiewicz Inequality for Quadratically Regularized Optimal Transport
Proves local error bound and PL inequality for QOT dual with explicit constants, enabling linear convergence of ascent methods.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.