Pith. sign in

RipsNet: a general architecture for fast and robust estimation of the persistent homology of point clouds

1 Pith paper cite this work, alongside 7 external citations. Polarity classification is still indexing.

1 Pith paper citing it
7 external citations · Pith
abstract

The use of topological descriptors in modern machine learning applications, such as Persistence Diagrams (PDs) arising from Topological Data Analysis (TDA), has shown great potential in various domains. However, their practical use in applications is often hindered by two major limitations: the computational complexity required to compute such descriptors exactly, and their sensitivity to even low-level proportions of outliers. In this work, we propose to bypass these two burdens in a data-driven setting by entrusting the estimation of (vectorization of) PDs built on top of point clouds to a neural network architecture that we call RipsNet. Once trained on a given data set, RipsNet can estimate topological descriptors on test data very efficiently with generalization capacity. Furthermore, we prove that RipsNet is robust to input perturbations in terms of the 1-Wasserstein distance, a major improvement over the standard computation of PDs that only enjoys Hausdorff stability, yielding RipsNet to substantially outperform exactly-computed PDs in noisy settings. We showcase the use of RipsNet on both synthetic and real-world data. Our open-source implementation is publicly available at https://github.com/hensel-f/ripsnet and will be included in the Gudhi library.

fields

cs.AI 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Computing and Learning on Combinatorial Data

cs.AI · 2025-02-07 · conditional · novelty 4.0

A dissertation compiling five prior papers: GPU-accelerated persistent homology (HYPHA, Ripser++), near-linear-time approximated Wasserstein distance for persistence diagrams (PDoptFlow), and topology-based graph and hypergraph learning (GEFL, symmetry breaking).

citing papers explorer

Showing 1 of 1 citing paper.

  • Computing and Learning on Combinatorial Data cs.AI · 2025-02-07 · conditional · none · ref 234 · internal anchor

    A dissertation compiling five prior papers: GPU-accelerated persistent homology (HYPHA, Ripser++), near-linear-time approximated Wasserstein distance for persistence diagrams (PDoptFlow), and topology-based graph and hypergraph learning (GEFL, symmetry breaking).