The sublevel Flood bifiltration: towards scalable 2-parameter persistent homology
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2609.37177v1 Announce Type: cross Abstract: Persistent homology (PH) is a frequently used tool for extracting and preserving topological information from image data, particularly in image segme...
arXiv:2505. 04346v2 Announce Type: replace Abstract: Clustering aims at partitioning data points into groups of similar objects without knowing about the class labels.
The paper introduces a differentiability framework for zigzag persistent homology, enabling the use of zigzag persistence in learning pipelines. By linearly interpolating filtering values on a fixed complex and assigning real-valued times to persistence diagram endpoints, the authors transfer continuity from filtering values to diagram points, yielding smooth local lifts and almost everywhere differentials under mild regularity conditions. They prove local Lipschitz continuity outside an explicit measure‑zero exclusion set and demonstrate the framework’s practical effectiveness through experiments on sensor network coverage optimization and dynamic graph classification.
arXiv:2506. 15020v2 Announce Type: replace-cross Abstract: We propose persistent discrete homology as a tool for topological data analysis and discuss its advantages over the existing methods.
arXiv:2507. 07156v2 Announce Type: replace-cross Abstract: Supervised machine learning pipelines trained on features derived from persistent homology have been experimentally observed to ignore much of the information contained in a persistence diagram.
The paper introduces a unified pipeline that classifies univariate time series by first converting them into graphs using one of five constructions from three families (visibility, transition, proximity). The resulting graph is turned into a dissimilarity matrix, from which a Vietoris–Rips filtration produces persistence diagrams that are vectorized via persistence landscapes and topological summary statistics. Experiments on twelve UCR benchmarks reveal that no single graph construction dominates, diffusion distance consistently outperforms shortest-path metrics, and persistence-based features remain robust to noise.