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

• URL: http://arxiv.org/abs/2608.27774v1
• Date: Thu, 27 Aug 2026 23:14:38 GMT
• Title: Beyond Procrustes distances: a multilinear Gromov-Wasserstein distance capturing chirality
• Abstract summary: Existing shape analysis metrics fail to distinguish between a shape and its mirror image.<n>We introduce a multilinear generalization of the Gromov-Wasserstein objective.<n>We develop efficient algorithms to compute the Chiral Gromov-Wasserstein distances.
• Score: 1.053849862914584
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms [2.7787719874237986]
  This paper studies the Gromov-Wasserstein (GW) quantization, which additionally aims at clustering the ambient geometry of the space.<n>We show existence of solutions to the GW quantization problem and give a characterization that justifies an analogue to the $k$-means algorithm.<n> numerical experiments show that GW quantization opens up many modeling possibilities beyond normal clustering methods.
  arXiv  Detail & Related papers  (2026-08-11T14:58:31Z)
• Intrinsic Wasserstein Rates for Score-Based Generative Models on Smooth Manifolds [61.14405512940818]
  We show that Score-based generative models are trained in high-dimensional ambient spaces.<n>We use a ReLU implementation of nearest-projection coordinates via finite intrinsic anchors and Gauss Newton.
  arXiv  Detail & Related papers  (2026-05-15T10:20:05Z)
• Provably Adaptive Linear Approximation for the Shapley Value and Beyond [73.0940890296463]
  A fundamental and long-standing challenge is their efficient approximation.<n>We develop a linear-space algorithm that requires $P(|hatboldsymbol-boldsymbol|_2geq)leq $ for all commonly used semi-values.<n>Our algorithm allows explicit minimization of the mean square error for each specific utility function.
  arXiv  Detail & Related papers  (2026-04-09T16:38:14Z)
• Efficient Distribution Learning with Error Bounds in Wasserstein Distance [5.3077298055859545]
  Wasserstein distance has emerged as a key metric to quantify distances between probability distributions.<n>We devise a novel framework to approximate an unknown probability distribution $mathbbP$ from a finite set of samples.
  arXiv  Detail & Related papers  (2026-02-08T17:14:30Z)
• The Joint Gromov Wasserstein Objective for Multiple Object Matching [0.6875312133832079]
  We introduce the Joint Gromov-Wasserstein (JGW) objective and extend the original framework of GW to enable simultaneous matching between collections of objects.<n>Our formulation provides a non-negative dissimilarity measure that identifies partially isomorphic of mm-spaces, with point sampling convergence.<n>Our benchmarking with other variants of GW for partial matching indicates superior performance in accuracy and computational efficiency of our method, while experiments on both synthetic and real-world datasets show its effectiveness for multiple shape matching.
  arXiv  Detail & Related papers  (2025-11-21T00:31:21Z)
• Relative-Translation Invariant Wasserstein Distance [82.6068808353647]
  We introduce a new family of distances, relative-translation invariant Wasserstein distances ($RW_p$) We show that $RW_p distances are also real distance metrics defined on the quotient set $mathcalP_p(mathbbRn)/sim$ invariant to distribution translations.
  arXiv  Detail & Related papers  (2024-09-04T03:41:44Z)
• Efficient Graph Field Integrators Meet Point Clouds [59.27295475120132]
  We present two new classes of algorithms for efficient field integration on graphs encoding point clouds. The first class, SeparatorFactorization(SF), leverages the bounded genus of point cloud mesh graphs, while the second class, RFDiffusion(RFD), uses popular epsilon-nearest-neighbor graph representations for point clouds.
  arXiv  Detail & Related papers  (2023-02-02T08:33:36Z)
• Wasserstein K-Means for Clustering Tomographic Projections [6.878995336760916]
  We present a k-means algorithm based on a rotationally-invariant Wasserstein metric for images. There is little computational overhead, thanks to the use of a fast linear-time approximation to the Wasserstein-1 metric, also known as the Earthmover's distance.
  arXiv  Detail & Related papers  (2020-10-20T03:28:17Z)
• Augmented Sliced Wasserstein Distances [55.028065567756066]
  We propose a new family of distance metrics, called augmented sliced Wasserstein distances (ASWDs) ASWDs are constructed by first mapping samples to higher-dimensional hypersurfaces parameterized by neural networks. Numerical results demonstrate that the ASWD significantly outperforms other Wasserstein variants for both synthetic and real-world problems.
  arXiv  Detail & Related papers  (2020-06-15T23:00:08Z)
• Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces [62.35667646858558]
  We introduce the Anchor Energy (AE) and Anchor Wasserstein (AW) distances, which are respectively the energy and Wasserstein distances instantiated on such representations. Our main contribution is to propose a sweep line algorithm to compute AE emphexactly in log-quadratic time, where a naive implementation would be cubic. We show that AE and AW perform well in various experimental settings at a fraction of the computational cost of popular GW approximations.
  arXiv  Detail & Related papers  (2020-02-05T03:09:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.