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
An LLM confidence score isn’t correctness: the certainty trap
0dev.to
What a host-side layer for LLM agents is, in plain words (and what it is not)
0dev.to
OpenAI's Agents API Lets Any App Rent Codex, Here's How It Works
0dev.to

94% of Singapore Small Business Owners Surveyed Say More AI Guidance Is Needed
0Meta Newsroom
Nashville, Tennessee Real Estate Dataset: 7,436 Listings, Excel File (Nov 10, 2026)
0dev.to Data
A Hundred and Eighty Six Thousand Pounds of Stock Had Left One Branch and Never Arrived at Another
0dev.to Data