arXiv (All)
open access
Quantitative Stability and Sample Complexity for Regularized Gromov-Wasserstein Distance
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 regu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distance-Matrix Wasserstein Statistics for Scalable Gromov--Wasserstein Learning#187327
- Dimension-free Convergence Rate in Sliced Wasserstein Distance for Empirical Measures of Markov Processes#1343647
- Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation#204775
- A constant-factor approximation of the Gromov-Hausdorff distance in the plane#1050894
- Sierpiński--Knopp Wasserstein Distance for Persistence Diagrams and Applications to 2-Wasserstein Approximation#627682
Record · ID 1325458
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive