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
200 countries: Google Maps just became an agent
0dev.to AI
MiniMax H3 Long Video: The Human-in-the-Loop Editing Pattern
0dev.to AI
From Artificial Neurons to AlexNet and Beyond.
0dev.to AI

국내 대표 AI 기업 11개사, 2026년 허깅페이스 공개 모델 다운로드 분석
0dev.to AI
Token Cost Reality Check: Running Xinference for Multi-Model RAG Without Breaking the Budget
0dev.to Python

qwen3.5-4b on a 16 GB RTX 5060 Ti: 823 tokens per second for 16 users
0dev.to DevOps