AI & ML
On sparsity, extremal structure, and monotonicity properties of Wasserstein and Gromov-Wasserstein optimal transport plans
arXiv stat.ML0 views
arXiv:2602.16265v3 Announce Type: replace Abstract: This note gives a self-contained overview of some key properties of the Gromov-Wasserstein (GW) distance, compared with the standard linear optimal transport (OT) framework. More specifically, I explore the following questions: are GW optimal transport plans sparse? under what conditions does there exist an optimal plan supported on a permutation? do optimal plans satisfy a form of cyclical monotonicity? In particular, I present the conditionally negative/positive definite (CND/CPD) properties and show that, when they hold, there exist GW optimal plans that are sparse and supported on a permutation. In the last section, I also give examples where no permutation is optimal when the CND or CPD assumption is dropped.
Source:https://arxiv.org/abs/2602.16265PreviousRecovering the Euclidean Geometry of High-Dimensional Data Under Heterogeneous NoiseNextAuto-differentiable data assimilation: Co-learning of states, dynamics, and filtering algorithms
Related posts
Whistleblower complaint against Pentagon over Iran strike that killed 6
0Hacker News

Obituaries
0Stratechery
Scans for LiteLLM/Starlette (CVE-2026-42271, CVE-2026-48710), (Mon, Nov 16th)
0SANS ISC

Active Debt vs Settled Debt: The Lifecycle State Machine Inside FinLedger's Lending Engine
0dev.to UX
Automatic clock-in for construction crews: designing for bad GPS
0dev.to UX
10 Food Puns That Will Make You Smile at the Dinner Table
0dev.to Watercooler