arXiv Open Access 2024

Note on computational complexity of the Gromov-Wasserstein distance

Natalia Kravtsova

Lihat Sumber

Abstrak

This note addresses computational difficulty of the Gromov-Wasserstein distance frequently mentioned in the literature. We provide details on the structure of the Gromov-Wasserstein distance optimization problem that show its non-convex quadratic nature for any instance of an input data. We further illustrate the non-convexity of the problem with several explicit examples.

Topik & Kata Kunci

stat.ML cs.LG

Penulis (1)

Natalia Kravtsova

Format Sitasi

APA MLA BibTeX

Kravtsova, N. (2024). Note on computational complexity of the Gromov-Wasserstein distance. https://arxiv.org/abs/2408.06525

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2024
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓