Stable Vectorization of Multiparameter Persistent Homology using Signed Barcodes as Measures
David Loiseaux, Luis Scoccola, Mathieu Carrière, Magnus Bakke Botnan, Steve Oudot
Abstract
Persistent homology (PH) provides topological descriptors for geometric data, such as weighted graphs, which are interpretable, stable to perturbations, and invariant under, e.g., relabeling. Most applications of PH focus on the one-parameter case -- where the descriptors summarize the changes in topology of data as it is filtered by a single quantity of interest -- and there is now a wide array of methods enabling the use of one-parameter PH descriptors in data science, which rely on the stable vectorization of these descriptors as elements of a Hilbert space. Although the multiparameter PH (MPH) of data that is filtered by several quantities of interest encodes much richer information than its one-parameter counterpart, the scarceness of stability results for MPH descriptors has so far limited the available options for the stable vectorization of MPH. In this paper, we aim to bring together the best of both worlds by showing how the interpretation of signed barcodes -- a recent family of MPH descriptors -- as signed measures leads to natural extensions of vectorization strategies from one parameter to multiple parameters. The resulting feature vectors are easy to define and to compute, and provably stable. While, as a proof of concept, we focus on simple choices of signed barcodes and vectorizations, we already see notable performance improvements when comparing our feature vectors to state-of-the-art topology-based methods on various types of data.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3873af07-b20a-45c0-b951-918530e1aa3fCited by top-tier papers8
- Graphcode: Learning from multiparameter persistent homology using graph neural networksFlorian Russold, Michael KerberNeurIPS 2024 · 15 citations
- Differentiability and Optimization of Multiparameter Persistent HomologyLuis Scoccola, Siddharth Setlur, David Loiseaux, Mathieu Carrière et al.ICML 2024 · 13 citations
- Delaunay Bifiltrations of Functions on Point CloudsÁngel Javier Alonso, Michael Kerber, Tung Lam, Michael LesnickSODA 2024 · 3 citations
- TopoFormer: Topology Meets Attention for Graph LearningMd Joshem Uddin, Astrit Tola, Cuneyt Gurcan Akcora, Baris CoskunuzerICLR 2026 · 2 citations
- Graph Persistence goes SpectralMattie Ji, Amauri H. Souza, Vikas GargNeurIPS 2025 · 1 citation
Builds on1
Related papers
- A Framework for Fast and Stable Representations of Multiparameter Persistent Homology DecompositionsDavid Loiseaux, Mathieu Carrière, Andrew J. BlumbergNeurIPS 2023 · 21 citations
- Harmonic Persistent Homology (extended abstract)Saugata Basu, Nathanael CoxFOCS 2021 · 1 citation
- On topological descriptors for graph productsMattie Ji, Amauri H. Souza, Vikas GargNeurIPS 2025 · 3 citations
- MCbiF: Measuring Topological Autocorrelation in Multiscale Clusterings via 2-Parameter Persistent HomologyJuni Schindler, Mauricio BarahonaICLR 2026 · 1 citation
- Computing Minimal Persistent Cycles: Polynomial and Hard CasesTamal K. Dey, Tao Hou, Sayan MandalSODA 2020 · 18 citations
