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

Senator slams Commerce Secretary for flow of Nvidia AI chips to China
0The Verge
They Found You Through a Photograph…
0dev.to
The Joy of Boring Code: Why Writing "Clever" Code is Overrated
0dev.to
From fMRI to images: what Brain-IT reconstructs—and what it does not
0dev.to
Vad ska vi automatisera först? En poängmodell för småföretag
0dev.to

Octopus Energy is bringing its sold-out plug-in solar panels to UK small businesses, says move was a 'no-brainer' following huge demand
0TechRadar