The Joint Gromov Wasserstein Objective for Multiple Object Matching
Aryan Tajmir Riahi, Khanh Dao Duc

TL;DR
This paper introduces the Joint Gromov-Wasserstein (JGW) objective, extending GW to enable simultaneous matching of multiple objects, improving accuracy and efficiency in complex shape and biological data matching tasks.
Contribution
The paper proposes a novel JGW framework that generalizes GW for multiple object matching, with algorithms adapted for point cloud data and demonstrated superior performance.
Findings
JGW provides a non-negative dissimilarity measure for collections of objects.
The method achieves better accuracy and computational efficiency than existing GW variants.
Effective in matching geometric shapes and biomolecular complexes in synthetic and real datasets.
Abstract
The Gromov-Wasserstein (GW) distance serves as a powerful tool for matching objects in metric spaces. However, its traditional formulation is constrained to pairwise matching between single objects, limiting its utility in scenarios and applications requiring multiple-to-one or multiple-to-multiple object matching. In this paper, we introduce the Joint Gromov-Wasserstein (JGW) objective and extend the original framework of GW to enable simultaneous matching between collections of objects. Our formulation provides a non-negative dissimilarity measure that identifies partially isomorphic distributions of mm-spaces, with point sampling convergence. We also show that the objective can be formulated and solved for point cloud representations by adapting traditional algorithms in Optimal Transport, including entropic regularization. Our benchmarking with other variants of GW for partial…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
