Metraipolis › archive › dc_d7c849ff2a05
A differentiability framework for zigzag persistent homology via linear interpolation — arXiv:2609.39242
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39242
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T13:45:58.775Z
- SHA-256 of the archived text
1e664796af1a2398c3b7e37ae7d9514c6f6d7915c337509ef83515cc5a240e42- Stable URL of this page
https://metraipolis.com/documento/dc_d7c849ff2a05
How to cite
A differentiability framework for zigzag persistent homology via linear interpolation — arXiv:2609.39242 — arXiv (en), https://arxiv.org/abs/2609.39242 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d7c849ff2a05 (Metraipolis archive dc_d7c849ff2a05, sha256 1e664796af1a2398c3b7e37ae7d9514c6f6d7915c337509ef83515cc5a240e42)
BibTeX
@misc{dcd7c849ff2a05,
title = {A differentiability framework for zigzag persistent homology via linear interpolation — arXiv:2609.39242},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39242},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d7c849ff2a05; sha256 1e664796af1a2398c3b7e37ae7d9514c6f6d7915c337509ef83515cc5a240e42},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39242. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Persistent homology can be differentiated and incorporated into learning pipelines, but no analogous framework exists for zigzag persistence, which is needed when the underlying topological structure evolves non-monotonically over time. We develop such a framework for sequences of simplicial complexes obtained by thresholding time-dependent filtering values on a fixed complex. By assigning persistence diagram endpoints the real-valued times at which linearly interpolated filtering values cross the threshold, we transfer the continuity of the filtering values to the diagram points. This yields smooth local lifts of the resulting persistence-diagram-valued map, from which we derive differentials almost everywhere under mild regularity conditions on the parametrization of the filtering values. We prove local Lipschitz continuity outside an explicit measure-zero exclusion set; standard stochastic subgradient convergence guarantees therefore do not apply directly. We argue that, even without such guarantees, this exclusion set is small enough in practice to allow effective optimization. We test this empirically in two experiments: sensor network coverage optimization and dynamic graph classification. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-01 in cs.LG). Categorie arXiv: Machine Learning (cs.LG) ; Computational Geometry (cs.CG); Algebraic Topology (math.AT). Pagina del lavoro: https://arxiv.org/abs/2609.39242 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T13:18:10.344Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).