Pith. sign in

REVIEW 1 cited by

Quadratically Regularized Optimal Transport: Existence and Multiplicity of Potentials

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

arxiv 2404.06847 v3 pith:WIFLLMY6 submitted 2024-04-10 math.OC math.PR

classification math.OCmath.PR
keywords potentialsoptimalsparsitysupportcontinuouscostexistenceproblem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The optimal transport problem with quadratic regularization is useful when sparse couplings are desired. The density of the optimal coupling is described by two functions called potentials; equivalently, potentials can be defined as a solution of the dual problem. We prove the existence of potentials for a general square-integrable cost. Potentials are not necessarily unique, a phenomenon directly related to sparsity of the optimal support. For discrete problems, we describe the family of all potentials based on the connected components of the support, for a graph-theoretic notion of connectedness. On the other hand, we show that continuous problems have unique potentials under standard regularity assumptions, regardless of sparsity. Using potentials, we prove that the optimal support is indeed sparse for small regularization parameter in a continuous setting with quadratic cost, which seems to be the first theoretical guarantee for sparsity in this context.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Displacement-Sparse Neural Optimal Transport

    cs.LG 2025-02 conditional novelty 7.0 of 10

    A biased sparsity penalty in the neural OT minimax objective yields displacement-sparse maps, with an adaptive penalty schedule that outperforms fixed strengths on synthetic and real perturbation data.

Pith tools