Metraipolis › archive › dc_acaa97797526
Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms — arXiv:2608.11016
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.11016
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:19:53.090Z
- SHA-256 of the archived text
2d79e57a1255a3928c4432ad6733b246a46ea2da84dd35d25c416e12fd4c69db- Stable URL of this page
https://metraipolis.com/documento/dc_acaa97797526
How to cite
Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms — arXiv:2608.11016 — arXiv (en), https://arxiv.org/abs/2608.11016 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_acaa97797526 (Metraipolis archive dc_acaa97797526, sha256 2d79e57a1255a3928c4432ad6733b246a46ea2da84dd35d25c416e12fd4c69db)
BibTeX
@misc{dcacaa97797526,
title = {Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms — arXiv:2608.11016},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.11016},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_acaa97797526; sha256 2d79e57a1255a3928c4432ad6733b246a46ea2da84dd35d25c416e12fd4c69db},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11016. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Clustering is a fundamental class of data analysis techniques with the most important representatives being centroid-based methods like $k$-means. Such methods are strongly connected to quantization problems, which aim to approximate general probability measures with discrete ones. For example, $k$-means corresponds to quantization with respect to the Wasserstein distance. While Wasserstein quantization clusters points within a fixed space, this paper studies Gromov-Wasserstein (GW) quantization, which additionally aims at clustering the ambient geometry of the space. We show existence of solutions to the GW quantization problem and give a characterization that justifies an analogue to the $k$-means algorithm (Lloyd's algorithm) to approximate them numerically. We further calculate the quantization rate for usual Euclidean geometries that are used in the GW context, and relate it to standard Wasserstein quantization rates. Finally, numerical experiments show that GW quantization opens up many modeling possibilities beyond normal clustering methods (e.g., for geodesic distances of 3D shapes or structured pruning of neural networks) and that the introduced algorithm leads to useful numerical solutions with approximation quality often in line with theoretically optimal rates. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-12 in cs.LG). Categorie arXiv: Optimization and Control (math.OC) ; Computational Geometry (cs.CG); Machine Learning (cs.LG); Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2608.11016 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T06:11:45.152Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).