Recovering Manifold Structure Using Ollivier-Ricci Curvature

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Saidi, Tristan Luca, Hickok, Abigail, Blumberg, Andrew J.
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916867567779840
author Saidi, Tristan Luca
Hickok, Abigail
Blumberg, Andrew J.
author_facet Saidi, Tristan Luca
Hickok, Abigail
Blumberg, Andrew J.
contents We introduce ORC-ManL, a new algorithm to prune spurious edges from nearest neighbor graphs using a criterion based on Ollivier-Ricci curvature and estimated metric distortion. Our motivation comes from manifold learning: we show that when the data generating the nearest-neighbor graph consists of noisy samples from a low-dimensional manifold, edges that shortcut through the ambient space have more negative Ollivier-Ricci curvature than edges that lie along the data manifold. We demonstrate that our method outperforms alternative pruning methods and that it significantly improves performance on many downstream geometric data analysis tasks that use nearest neighbor graphs as input. Specifically, we evaluate on manifold learning, persistent homology, dimension estimation, and others. We also show that ORC-ManL can be used to improve clustering and manifold learning of single-cell RNA sequencing data. Finally, we provide empirical convergence experiments that support our theoretical findings.
format Preprint
id arxiv_https___arxiv_org_abs_2410_01149
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Recovering Manifold Structure Using Ollivier-Ricci Curvature
Saidi, Tristan Luca
Hickok, Abigail
Blumberg, Andrew J.
Machine Learning
Artificial Intelligence
Computational Geometry
We introduce ORC-ManL, a new algorithm to prune spurious edges from nearest neighbor graphs using a criterion based on Ollivier-Ricci curvature and estimated metric distortion. Our motivation comes from manifold learning: we show that when the data generating the nearest-neighbor graph consists of noisy samples from a low-dimensional manifold, edges that shortcut through the ambient space have more negative Ollivier-Ricci curvature than edges that lie along the data manifold. We demonstrate that our method outperforms alternative pruning methods and that it significantly improves performance on many downstream geometric data analysis tasks that use nearest neighbor graphs as input. Specifically, we evaluate on manifold learning, persistent homology, dimension estimation, and others. We also show that ORC-ManL can be used to improve clustering and manifold learning of single-cell RNA sequencing data. Finally, we provide empirical convergence experiments that support our theoretical findings.
title Recovering Manifold Structure Using Ollivier-Ricci Curvature
topic Machine Learning
Artificial Intelligence
Computational Geometry
url https://arxiv.org/abs/2410.01149