Skip to content
DraconiticResearch
Search Sources API
194,226 studies31 sourcesUpdated 31 min ago
PreprintCC BY 4.0arXiv

Quantitative Stability and Sample Complexity for Regularized Gromov-Wasserstein Distance

Abstract

The Gromov-Wasserstein (GW) distance provides a principled framework for comparing two probability distributions supported on different metric spaces by matching their individual intrinsic geometric structures. In practice, the GW distance is estimated from finite samples and often incorporates regularization for statistical and computational tractability. This motivates a quantitative understanding of the stability and estimation error of regularized GW distances. In this work, we study a general family of divergence regularized GW distances, including entropy and Tsallis regularizations over the full range of powers, from a nonasymptotic perspective. Specifically, we establish Lipschitz continuity of the value of regularized GW and H{ö}lder continuity of its optimal coupling under Wasserstein perturbations of the input probability measures. Moreover, we derive the parametric rate of convergence for the empirical regularized (2,2)-GW distance on compactly supported Euclidean spaces.

Related

  1. Quantitative QSD convergence in 1-Wasserstein distance via the Föllmer drift
    Joaquín Fontbona, Pablo López-Rivera
    arXivPreprintCC BY-NC-ND 4.0Full textProbabilityarXiv
  2. Quantitative stability of classical, entropic, and doubly entropic Wasserstein barycenters
    Guillaume Carlier, Julien Guérin, Quentin Mérigot
    HALPreprintCC BY-NC-ND 4.0Full textOptimisation & controlHAL
  3. Continuous Dual Maximizers for Fixed-Reference Entropy-Regularized Wasserstein Barycenters
    Chamila Malagoda Gamage
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  4. On Over-Conservatism Under Low-Probability Extreme Events: A KL-Regularized Wasserstein Distributionally Robust Planning Method
    Xinda Shen, Yifan Su, Bo Hu +3
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. The p-Bures-Wasserstein distance via 3×3 block matrices (with application to p-Bures-Wasserstein barycenters)
    Suvrit Sra
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
BibTeX
@misc{li2026quantitative,
  title = {{Quantitative Stability and Sample Complexity for Regularized Gromov-Wasserstein Distance}},
  author = {Pengtao Li and Xiaohui Chen},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.14562},
  eprint = {2610.14562},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.14562},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Quantitative Stability and Sample Complexity for Regularized Gromov-Wasserstein Distance
AU  - Pengtao Li
AU  - Xiaohui Chen
PY  - 2026
DA  - 2026/10/10
PB  - arXiv
DO  - 10.48550/arxiv.2610.14562
UR  - https://arxiv.org/abs/2610.14562
AB  - The Gromov-Wasserstein (GW) distance provides a principled framework for comparing two probability distributions supported on different metric spaces by matching their individual intrinsic geometric structures. In practice, the GW distance is estimated from finite samples and often incorporates regularization for statistical and computational tractability. This motivates a quantitative understanding of the stability and estimation error of regularized GW distances. In this work, we study a general family of divergence regularized GW distances, including entropy and Tsallis regularizations over the full range of powers, from a nonasymptotic perspective. Specifically, we establish Lipschitz continuity of the value of regularized GW and H{ö}lder continuity of its optimal coupling under Wasserstein perturbations of the input probability measures. Moreover, we derive the parametric rate of convergence for the empirical regularized (2,2)-GW distance on compactly supported Euclidean spaces.
ER  -