Hugging Face Trending Papers
Lifting PCA in the Wasserstein Space
Read the original on Hugging Face Trending Papers →The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
Related stories
arXiv Machine Learning
Oct 22
Lifting PCA in the Wasserstein Space
The paper introduces Lifted PCA, a canonical extension of Euclidean PCA to the Wasserstein space of probability measures. By lifting variational formulations on the Stiefel and Grassmann manifolds, the authors derive equivalent minimization problems over probability measures that correspond to Wasserstein barycenters with generalized costs. The work establishes dual formulations, optimality conditions, connections to multimarginal optimal transport, statistical consistency, and computational algorithms, and demonstrates practical performance on distributional datasets.
arXiv Machine Learning
Jun 17
Another Look at Log-PCA for Probability Measures: A Dynamical Formulation and Statistical Convergence
arXiv:2606. 17196v1 Announce Type: cross Abstract: This paper is concerned with learning principal variations of random probability measures on $\mathbb{R}^m$ under the Wasserstein geometry.
arXiv AI
Jun 16
Canonical Variates in Wasserstein Metric Space
arXiv:2405. 15768v2 Announce Type: replace-cross Abstract: In this paper, we address the classification of instances represented by distributions on a vector space rather than single points.
arXiv Machine Learning
Oct 12
Linearized Wasserstein dimensionality reduction with approximation guarantees
The paper introduces LOT Wassmap, an algorithm designed to uncover low‑dimensional structures in the Wasserstein space without computing a full pairwise distance matrix. It leverages approximation schemes such as Sinkhorn distances and linearized optimal transport to accelerate computations, and provides theoretical guarantees on embedding quality even when only finite samples are available. Experiments show that LOT Wassmap achieves accurate embeddings that improve with larger sample sizes while significantly reducing computational cost compared to traditional pairwise‑distance‑based methods.
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 18
The Observable Wasserstein Distance
arXiv:2605. 09916v2 Announce Type: replace-cross Abstract: We introduce the observable Wasserstein distance, a framework for deriving lower bounds on the Wasserstein distance between probability measures on Polish metric spaces, designed to bypass the computational intractability of exact optimal transport in large-scale, non-Euclidean datasets.