Skip to content

Beyond Procrustes distances: a multilinear Gromov-Wasserstein distance capturing chirality

Aug 2026 · 0 citations
Mathematics Computer Science

Abstract

Efficiently and robustly analyzing shape data is critical across many scientific disciplines. While chirality is a fundamental property in numerous applications - most notably in molecular science - existing shape analysis metrics fail to distinguish between a shape and its mirror image. To address this gap, we introduce a multilinear generalization of the Gromov-Wasserstein objective. Under mild assumptions, this objective yields a distance between shapes, represented as probability distributions quotiented by a symmetry group $G$. In particular, for $G = SO(d)$, we introduce the Chiral Gromov-Wasserstein ($\mathrm{CGW}$) distance, sensitive to chirality. We establish robustness properties for the multilinear Gromov-Wasserstein distances and develop efficient algorithms to compute them, reformulating the underlying optimization problem by projecting couplings onto a low-dimensional space. We derive algorithms for both local and approximate global solutions, yielding a fully polynomial-time approximation scheme for these problems. We validate the framework through numerical experiments that demonstrate the effectiveness of $\mathrm{CGW}$ as a shape metric for chiral objects.

View source

Similar papers

Preprint Sep 2026

Discrete Gromov-Wasserstein Duality: Algorithms and Isomorphism Testing

The Gromov-Wasserstein (GW) distance provides a principled framework for aligning metric measure (mm) spaces based solely on their intrinsic structure. Its ability to identify isomorphic representations of distributions across spaces renders it valuable for comparing data where equality up to isomorphism occurs natural...

Gabriel Rioux, Joanna Marks, Riccardo Passeggeri et al. · 1 citation
Open access Jul 2025

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness

A Riemannian optimization framework for solving the EDMC problem by formulating it as a low-rank matrix completion task over the space of positive semi-definite Gram matrices, which provides a geometric interpretation of matrix incoherence tailored to the EDMC setting and provides robustness guarantees for the method.

Chandler Smith, HanQin Cai, Abiy Tasissa · 3 citations
#data science Preprint Aug 2026

Gromov-Monge Flow Matching for Equivariant Graph Generation

This work develops this perspective theoretically, showing that quotient couplings can be lifted to aligned representatives without additional cost and that symmetrization yields equivariant flow-matching minimizers, including for categorical endpoint prediction.

Moritz Piening, C. Wald · 0 citations
Preprint Sep 2026

Gromov-Wasserstein Barycenter Surrogates: Statistical Methodology, Distributional Limits and Applications

We introduce statistical theory for the matching of finitely many objects, represented as metric measure spaces (mm-spaces). The approach is based on the second lower bound (SLB) of the Gromov-Wasserstein distance and thus is able to identify deviations in the distributions of the (pairwise) distances within each mm-sp...

Florian Steinkamp, Luis-Alberto Rodríguez, Jan Victor Otte et al. · 0 citations
Preprint Aug 2026

Wasserstein Mahalanobis Distances for Recovering Latent Geometry

The proposed Wasserstein Mahalanobis distance approximates the classical Mahalanobis distance between the transformed latent means and holds up to controlled higher-order error terms for general smooth transformations.

Chuxiang Wang, Shi-Ying Li, Caroline Moosmüller · 0 citations
#machine learning Preprint Sep 2026

Sierpi\'nski--Knopp Wasserstein Distance for Persistence Diagrams and Applications to 2-Wasserstein Approximation

The SK-Wasserstein distance controls the classical \(2\)-Wasserstein distance between diagrams, admits an explicit isometric embedding into a Hilbert space, and induces a positive-definite Gaussian kernel, making the resulting geometry directly compatible with Euclidean and kernel-based learning methods.

Sebastien Tchitchek, Julien Tierny · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.