Pith. sign in

Quadratically Regularized Optimal Transport: Existence and Multiplicity of Potentials

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

citation-role summary

background 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Displacement-Sparse Neural Optimal Transport

cs.LG · 2025-02-03 · conditional · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Displacement-Sparse Neural Optimal Transport cs.LG · 2025-02-03 · conditional · none · ref 37 · internal anchor

    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.