Entropic Gromov-Wasserstein Distances: Stability and Algorithms
Keywords: Gromov-Wasserstein distance, entropic Gromov-Wasserstein distance, stability, algorithms
TL;DR: We provide novel stability results for the entropic Gromov-Wasserstein distance which enables us to provide, for the first time, efficient algorithms for solving it which are subject to non-asymptotic guarantees.
Abstract: The Gromov-Wasserstein (GW) distance quantifies discrepancy between metric measure spaces, but suffers from computational hardness. The entropic Gromov-Wasserstein (EGW) distance serves as a computationally efficient proxy for the GW distance. Recently, it was shown that the quadratic GW and EGW distances admit variational forms that tie them to the well-understood optimal transport (OT) and entropic OT (EOT) problems. By leveraging this connection, we establish convexity and smoothness properties of the objective in this variational problem. This results in the first efficient algorithms for solving the EGW problem that are subject to formal guarantees in both the convex and non-convex regimes.
Submission Number: 62
Loading