arXiv Machine Learning
Oct 2

A differentiability framework for zigzag persistent homology via linear interpolation

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.

By Enrico Maria Ferrari, Clemens Bannwart, Matteo Biagetti
arXiv Machine Learning
Jun 18

Unreduced Persistence Diagrams for Topological Machine Learning

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.

By Nicole Abreu, Parker B. Edwards, Francis Motta
arXiv Machine Learning
Sep 29

Persistent Homology of Time Series through Complex Networks

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.

By \.Ismail G\"uzel