arXiv Computer Vision By Krzysztof Marcin Choromanski, Derek Long, Ananya Parashar, Dwaipayan Saha

Unlocking Geodesic Gromov-Wasserstein Distances for 3D Modeling

Read the original on arXiv Computer Vision →

The paper introduces EGGroW, efficient algorithms for computing geodesic Gromov-Wasserstein distances using entropic Sinkhorn-like methods, GenusSink techniques, and random features. It addresses the cubic time complexity of traditional GWD calculations on dense intra-space distance matrices, enabling scalable comparisons of probabilistic distributions on general geodesic manifolds and graph shortest‑path distances. The authors demonstrate EGGroW’s effectiveness in downstream tasks such as 3D pose estimation and partial 3D template recovery, showing accurate results where Euclidean‑based methods fail while maintaining a light computational footprint.

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 Computer Vision.

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.

By Shanglin Li, Wenjing Lu, Muyang Li, Nicu Sebe, Ziheng Chen
arXiv Statistics ML
Sep 4

Discrete Gromov-Wasserstein Duality: Algorithms and Isomorphism Testing

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.

By Gabriel Rioux, Joanna Marks, Riccardo Passeggeri, Ziv Goldfeld
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.

By Binshuai Wang, Peng Wei