← Back to all news
arXiv Statistics ML By Gabriel Rioux, Joanna Marks, Riccardo Passeggeri, Ziv Goldfeld

Discrete Gromov-Wasserstein Duality: Algorithms and Isomorphism Testing

Read the original on arXiv Statistics ML →

The paper presents a new duality formulation for the Gromov‑Wasserstein distance that applies to all finitely supported metric‑measure spaces, with and without entropic regularization. Using this duality, the authors derive sample‑complexity bounds and limit distributions for empirical GW distances, and introduce algorithms with formal convergence guarantees. These results enable a principled, efficient method for testing isomorphism between distributions on graphs with a fixed number of nodes based on samples.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

Related stories

arXiv Machine Learning
Jun 10

$k$-Nearest Neighbors in Gromov--Wasserstein Space

arXiv:2606. 10295v1 Announce Type: cross Abstract: The Gromov--Wasserstein (GW) distance provides a framework for comparing metric measure spaces, regardless of their underlying structure or geometry.

By Kaitlyn Hohmeier, Nicolas Fraiman, Caroline Moosmueller
rag
More like this →
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.

By Edivaldo Lopes dos Santos, Leandro Vicente Mauri, Washington Mio, Tom Needham
More like this →
arXiv Machine Learning
6d ago

Optimal Transport for Network Comparison: A Review with Machine Learning Applications

The paper reviews the use of optimal transport for comparing undirected, unweighted graphs, focusing on three main distances: Wasserstein, Gromov-Wasserstein, and Bures-Wasserstein. It discusses closed-form solutions for the Wasserstein distance in one dimension, how transport plans identify influential nodes after perturbations, and derives spectral bounds for the Bures-Wasserstein distance to avoid full decompositions. The authors evaluate these distances on synthetic clustering data and a real-world time‑series network for anomaly detection.

By James Hyun, Fran\c{c}ois G. Meyer
More like this →