arXiv Statistics ML
Fr\'echet regression of multivariate distributions with nonparanormal transport
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Jun 30
Highly Data Parallelizable Estimation of the Sliced-Wasserstein Distance Using Cumulative Distribution Functions
arXiv:2606. 30310v1 Announce Type: cross Abstract: The Sliced Wasserstein (SW) distance has emerged as a computationally attractive alternative to the Wasserstein distance by leveraging one-dimensional optimal transport along random projections.
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
Jun 2
Convex Distance Operator Transport: A Convex and Geometry-Preserving Formulation
arXiv:2606. 02047v1 Announce Type: cross Abstract: We introduce Convex Distance Operator Transport (CDOT), the first convex optimal transport framework that aligns distributions across heterogeneous domains by jointly preserving feature correspondence and intrinsic geometric structure.
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
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.
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.