A Class of Topological Pseudodistances for Fast Comparison of Persistence Diagrams
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910340620484608 |
|---|---|
| author | Nuñez, Rolando Kindelan Petrache, Mircea Cerda, Mauricio Hitschfeld, Nancy |
| author_facet | Nuñez, Rolando Kindelan Petrache, Mircea Cerda, Mauricio Hitschfeld, Nancy |
| contents | Persistence diagrams (PD)s play a central role in topological data analysis, and are used in an ever increasing variety of applications. The comparison of PD data requires computing comparison metrics among large sets of PDs, with metrics which are accurate, theoretically sound, and fast to compute. Especially for denser multi-dimensional PDs, such comparison metrics are lacking. While on the one hand, Wasserstein-type distances have high accuracy and theoretical guarantees, they incur high computational cost. On the other hand, distances between vectorizations such as Persistence Statistics (PS)s have lower computational cost, but lack the accuracy guarantees and in general they are not guaranteed to distinguish PDs (i.e. the two PS vectors of different PDs may be equal). In this work we introduce a class of pseudodistances called Extended Topological Pseudodistances (ETD)s, which have tunable complexity, and can approximate Sliced and classical Wasserstein distances at the high-complexity extreme, while being computationally lighter and close to Persistence Statistics at the lower complexity extreme, and thus allow users to interpolate between the two metrics. We build theoretical comparisons to show how to fit our new distances at an intermediate level between persistence vectorizations and Wasserstein distances. We also experimentally verify that ETDs outperform PSs in terms of accuracy and outperform Wasserstein and Sliced Wasserstein distances in terms of computational complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_14489 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Class of Topological Pseudodistances for Fast Comparison of Persistence Diagrams Nuñez, Rolando Kindelan Petrache, Mircea Cerda, Mauricio Hitschfeld, Nancy Computational Geometry Computer Vision and Pattern Recognition Machine Learning Algebraic Topology 62R40, 55N31, 68T09, 62R07, 68T10 I.2; I.3.5; I.5.1; I.5.2; I.5.3; I.5.4 Persistence diagrams (PD)s play a central role in topological data analysis, and are used in an ever increasing variety of applications. The comparison of PD data requires computing comparison metrics among large sets of PDs, with metrics which are accurate, theoretically sound, and fast to compute. Especially for denser multi-dimensional PDs, such comparison metrics are lacking. While on the one hand, Wasserstein-type distances have high accuracy and theoretical guarantees, they incur high computational cost. On the other hand, distances between vectorizations such as Persistence Statistics (PS)s have lower computational cost, but lack the accuracy guarantees and in general they are not guaranteed to distinguish PDs (i.e. the two PS vectors of different PDs may be equal). In this work we introduce a class of pseudodistances called Extended Topological Pseudodistances (ETD)s, which have tunable complexity, and can approximate Sliced and classical Wasserstein distances at the high-complexity extreme, while being computationally lighter and close to Persistence Statistics at the lower complexity extreme, and thus allow users to interpolate between the two metrics. We build theoretical comparisons to show how to fit our new distances at an intermediate level between persistence vectorizations and Wasserstein distances. We also experimentally verify that ETDs outperform PSs in terms of accuracy and outperform Wasserstein and Sliced Wasserstein distances in terms of computational complexity. |
| title | A Class of Topological Pseudodistances for Fast Comparison of Persistence Diagrams |
| topic | Computational Geometry Computer Vision and Pattern Recognition Machine Learning Algebraic Topology 62R40, 55N31, 68T09, 62R07, 68T10 I.2; I.3.5; I.5.1; I.5.2; I.5.3; I.5.4 |
| url | https://arxiv.org/abs/2402.14489 |