Persistent homology for low-complexity models
From MaRDI portal
(Redirected from Publication:5160778)
Abstract: We show that recent results on randomized dimension reduction schemes that exploit structural properties of data can be applied in the context of persistent homology. In the spirit of compressed sensing, the dimension reduction is determined by the Gaussian width of a structure associated to the data set, rather than its size, and such a reduction can be computed efficiently. We further relate the Gaussian width to the doubling dimension of a finite metric space, which appears in the study of the complexity of other methods for approximating persistent homology. We can therefore literally replace the ambient dimension by an intrinsic notion of dimension related to the structure of the data.
Recommendations
- Dimensionality reduction for \(k\)-distance applied to persistent homology
- Morse theory for filtrations and efficient computation of persistent homology
- The persistent homology of distance functions under random projection
- A statistical approach to persistent homology
- One-dimensional reduction of multidimensional persistent homology
Cites work
- 10.1162/153244303321897690
- A mathematical introduction to compressive sensing
- A unified framework for linear dimensionality reduction in L1
- A wavelet tour of signal processing. The sparse way.
- Approximating extent measures of points.
- Asymptotic geometric analysis. I
- Clear and compress: computing persistent homology in chunks
- Computational topology. An introduction
- Concentration inequalities. A nonasymptotic theory of independence
- Dimensionality reduction with subgaussian matrices: a unified theory
- Effective Condition Number Bounds for Convex Regularization
- Efficient and robust persistent homology for measures
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 4021880 (Why is no real title available?)
- scientific article; zbMATH DE number 4061904 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- scientific article; zbMATH DE number 775023 (Why is no real title available?)
- scientific article; zbMATH DE number 3356050 (Why is no real title available?)
- Isometric sketching of any set via the restricted isometry property
- Lectures on analysis on metric spaces
- Lectures on Polytopes
- Living on the edge: phase transitions in convex programs with random data
- Nearest-neighbor-preserving embeddings
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- On sparse reconstruction from Fourier and Gaussian measurements
- Persistence theory. From quiver representations to data analysis
- Persistent homology -- state of the art and challenges
- Plongements lipschitziens dans ${\bbfR}\sp n$
- Probability in Banach spaces. Isoperimetry and processes
- Random projections of smooth manifolds
- Stability of persistence diagrams
- The convex geometry of linear inverse problems
- The cosparse analysis model and algorithms
- The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
- The persistent homology of distance functions under random projection
- The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
- The structure and stability of persistence modules
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Tighter bounds for random projections of manifolds
- Topological inference via meshing
- Topology and data
- Towards persistence-based reconstruction in euclidean spaces
- Upper and lower bounds for stochastic processes. Modern methods and classical problems
- Zigzag zoology: Rips zigzags for homology inference
Cited in
(6)- Dimensionality reduction for \(k\)-distance applied to persistent homology
- Persistent Homology Lower Bounds on High-Order Network Distances
- Essential Simplices in Persistent Homology and Subtle Admixture Detection
- Dimensionality Reduction for k-Distance Applied to Persistent Homology
- A normalized bottleneck distance on persistence diagrams and homology preservation under dimension reduction
- A Euclidean embedding for computing persistent homology with Gaussian kernels
This page was built for publication: Persistent homology for low-complexity models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160778)
