arXiv Machine Learning
Optimal Transportation and Alignment Between Gaussian Measures
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 28
Distance-Matrix Wasserstein Statistics for Scalable Gromov--Wasserstein Learning
arXiv:2605. 14981v2 Announce Type: replace Abstract: Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system.
arXiv Machine Learning
Jun 30
ITSPACE: Monotone Gaussian Optimal Transport Updates
arXiv:2606. 30523v1 Announce Type: new Abstract: Covariance matrices serve as compact descriptors of feature distributions in many machine-learning pipelines, including domain adaptation and Gaussian embeddings.
arXiv Machine Learning
Sep 23
Relative Wasserstein Angle and the Problem of the $W_2$-Nearest Gaussian Distribution
The paper introduces a geometric framework for measuring how far empirical datasets deviate from the Gaussian family using optimal transport theory. It defines two new quantities—the relative Wasserstein angle and the orthogonal projection distance—based on the cone structure of the relative translation invariant quadratic Wasserstein space, and shows that the usual moment‑matching Gaussian is not generally the $W_2$‑nearest Gaussian. Closed‑form expressions are derived for one‑dimensional and several location–scale families, while a numerical approximation is proposed for higher dimensions, with experiments demonstrating convergence, stability, and the angle’s robustness as a non‑Gaussianity indicator.
arXiv Machine Learning
Aug 6
Multimodal Alignment Through Joint Kernel Entropic Gromov--Wasserstein Optimal Transport
arXiv:2608. 04234v1 Announce Type: cross Abstract: We study the problem of aligning data from multiple modalities into a shared representation space, focusing on settings where strong pretrained unimodal encoders are available but cross-modal paired data are scarce.
arXiv Machine Learning
1d ago
Constant-Curvature Sliced Gromov-Wasserstein for Heterogeneous Cross-Curvature Alignment
The paper introduces Constant‑Curvature Sliced Gromov‑Wasserstein (CCSGW), a new divergence for aligning probability distributions on heterogeneous constant‑curvature spaces such as hyperbolic and spherical manifolds. It extends sliced Gromov‑Wasserstein by adding geodesic‑based one‑dimensional projections for spherical spaces, enabling efficient and principled comparison across manifolds with different curvatures while preserving intrinsic geometric relationships. The authors provide theoretical analysis showing that CCSGW controls intrinsic geometric discrepancy and demonstrate consistent performance gains when integrated into mixed‑curvature learning tasks like graph anomaly detection, node classification, and multimodal learning.
arXiv Machine Learning
Jun 9
Entropic Optimal Transport Eigenmaps for Nonlinear Alignment and Joint Embedding of High-Dimensional Datasets
arXiv:2407. 01718v2 Announce Type: replace-cross Abstract: Embedding high-dimensional data into a low-dimensional space is an indispensable component of data analysis.