arXiv:2606. 29665v1 Announce Type: cross Abstract: This paper examines how metric adjustments to Multidimensional Scaling (MDS) can enhance its effectiveness as a visual tool for pattern recognition.
By Flor Martinez-Sermeno, Arturo Jaramillo, Johan Van Horebeek
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.
By Christophe Vauthier, Quentin M\'erigot, Anna Korba
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.
By Jia Li, Lin Lin
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.
By Edivaldo Lopes dos Santos, Leandro Vicente Mauri, Washington Mio, Tom Needham
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.
By Ao Xu, Tieru Wu
arXiv:2510. 01015v3 Announce Type: cross Abstract: Wasserstein metrics are increasingly adopted as similarity scores for images.
By Erik Lager, Gilles Mordant, Amit Moscovich