Generalized persistence analysis based on stable rank invariant
arXiv:1807.01217
Abstract
We believe three ingredients are needed for further progress in persistence and its use: invariants not relying on decomposition theorems to go beyond 1-dimension, outcomes suitable for statistical analysis and a setup adopted for supervised and machine learning. Stable rank, a continuous invariant for multidimensional persistence, was introduced in W. Chacholski et al. - Multidimensional persistence and noise, 2017. In the current paper we continue this work by demonstrating how one builds an efficient computational pipeline around this invariant and uses it in inference in case of one parameter. We demonstrate some computational evidence of the statistical stability of stable rank. We also show how our framework can be used in supervised learning.
arXiv comment17 pages
References in corpus (9)
- A roadmap for the computation of persistent homology
- Statistical topological data analysis using persistence landscapes
- Hierarchical structures of amorphous solids characterized by persistent homology
- Persistent homology of time-dependent functional networks constructed from coupled time series
- Metrics for generalized persistence modules
- Big Holes in Big Data: A Monte Carlo Algorithm for Detecting Large Hyper-rectangles in High Dimensional Data
- Limit theorems for persistence diagrams
- An Isometry Theorem for Generalized Persistence Modules
- Stable Invariants for Multiparameter Persistence