Partial Gromov-Wasserstein Metric
<|reference_start|>Partial Gromov-Wasserstein Metric: The Gromov-Wasserstein (GW) distance has gained increasing interest in the machine learning community in recent years, as it allows for the comparison of measures in different metric spaces. To overcome the limitations imposed by the equal mass requirements of the classical GW problem, researchers have begun exploring its application in unbalanced settings. However, Unbalanced GW (UGW) can only be regarded as a discrepancy rather than a rigorous metric/distance between two metric measure spaces (mm-spaces). In this paper, we propose a particular case of the UGW problem, termed Partial Gromov-Wasserstein (PGW). We establish that PGW is a well-defined metric between mm-spaces and discuss its theoretical properties, including the existence of a minimizer for the PGW problem and the relationship between PGW and GW, among others. We then propose two variants of the Frank-Wolfe algorithm for solving the PGW problem and show that they are mathematically and computationally equivalent. Moreover, based on our PGW metric, we introduce the analogous concept of barycenters for mm-spaces. Finally, we validate the effectiveness of our PGW metric and related solvers in applications such as shape matching, shape retrieval, and shape interpolation, comparing them against existing baselines.<|reference_end|>
@article{bai2024partial,
    title={Partial Gromov-Wasserstein Metric},
    author={Yikun Bai, Rocio Diaz Martin, Abihith Kothapalli, Hengrong Du, Xinran
  Liu, and Soheil Kolouri},
    journal={arXiv preprint arXiv:2402.03664},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.03664},
    primaryClass={cs.LG stat.ML}
}