Joint Metric Space Embedding by Unbalanced OT with Gromov-Wasserstein Marginal Penalization
Florian Beier, Moritz Piening, Robert Beinert, Gabriele Steidl
TL;DR
The paper addresses the problem of aligning heterogeneous data distributions without known correspondences by embedding them into a fixed metric space. It introduces an unbalanced optimal transport formulation with Gromov–Wasserstein marginal penalization, connected to the embedded Wasserstein distance, and proves minimizer existence and convergence as the penalty grows. A quadratic multi-marginal unbalanced OT reformulation with a bi-convex, Sinkhorn-based solver is developed, and the framework is related to JMDS while allowing non-Euclidean target spaces. Numerical results demonstrate joint embeddings across Euclidean and non-Euclidean domains, including 3D shapes, multimodal feature spaces, and Gaussian mixtures, showing improved alignment over competing methods and highlighting practical potential for cross-domain visualization and analysis.
Abstract
We propose a new approach for unsupervised alignment of heterogeneous datasets, which maps data from two different domains without any known correspondences to a common metric space. Our method is based on an unbalanced optimal transport problem with Gromov-Wasserstein marginal penalization. It can be seen as a counterpart to the recently introduced joint multidimensional scaling method. We prove that there exists a minimizer of our functional and that for penalization parameters going to infinity, the corresponding sequence of minimizers converges to a minimizer of the so-called embedded Wasserstein distance. Our model can be reformulated as a quadratic, multi-marginal, unbalanced optimal transport problem, for which a bi-convex relaxation admits a numerical solver via block-coordinate descent. We provide numerical examples for joint embeddings in Euclidean as well as non-Euclidean spaces.
