COMPLEX: A Closed-Form Certified Embedding of Multiparameter Persistence Modules
Not on the map. Why?
Abstract (arXiv)
Every multiparameter persistence vectorization we know of carries a one-sided Lipschitz upper bound and nothing below it: without a lower gauge there is no sense in which the features are faithful, and no per-prediction guarantee can be built on them. This paper supplies the missing side. COMPLEX is a closed-form, training-free embedding of multiparameter modules -- slice the module along a fixed near-diagonal net, embed each slice barcode by the certified PLACE/PALACE landmark map, concatenate. Under a checkable witnessing-slice coherence condition, holding on 100% of audited pairs on Orbit5k, a single slice carries a closed-form lower gauge: separated modules stay separated in the embedding. With the standard upper bound this gives, to our knowledge, the first two-sided distortion bound for a multiparameter feature map, making faithfulness measurable. Measuring it, we find the floor tight within a small factor of realized distances yet operationally local: an RBF-SVM reaches 91% where 1-NN reaches 78% on the same features. Local per-prediction certification therefore fails for a structural reason common to every landmark embedding whose lower gauge is witnessed by one coordinate. With no learned embedding and no held-out calibration -- only a cross-validated SVM head -- COMPLEX sets the state of the art on both Orbit benchmarks (91.95% on Orbit5k, 92.98% on Orbit100k), level with or above Euler-characteristic surfaces and above transformers and graphcode. On graphs it exceeds GRIL on all four shared molecular benchmarks with one fixed configuration, including the only multiparameter method to clear COX2's majority baseline by more than three points. Closed-form selection -- of the landmark radius, the kernel (certificate-preserving), and the bifiltration set -- buys further accuracy; gradient-shaped adaptation buys none.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 33 references that are in the map. First posted on arXiv 18 Sep 2026.
Builds on
22 of 33 references.
References · 22
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2019PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signaturescited by 125
- 2017Sliced Wasserstein Kernel for Persistence Diagramscited by 77
- 2018Persistence Fisher Kernel: A Riemannian Manifold Kernel for Persistence Diagramscited by 33
- 2019A Framework for Differential Calculus on Persistence Barcodescited by 29
- 2021Persformer: A Transformer Architecture for Topological Machine Learningcited by 19
- 2015Interactive Visualization of 2-D Persistence Modulescited by 18
- 2023Stable Vectorization of Multiparameter Persistent Homology using Signed Barcodes as Measurescited by 15
- 2023Euler Characteristic Tools For Topological Data Analysiscited by 13
- 2023GRIL: A 2-parameter Persistence Based Vectorization for Machine Learningcited by 13
- 2024TopoGCL: Topological Graph Contrastive Learningcited by 13
- 2018On the Metric Distortion of Embedding Persistence Diagrams into separable Hilbert spacescited by 9
10 more
- 2021Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions and Rank-Exact Resolutionscited by 6
- 2023A Framework for Fast and Stable Representations of Multiparameter Persistent Homology Decompositionscited by 6
- 2024Graphcode: Learning from multiparameter persistent homology using graph neural networkscited by 6
- 2024D-GRIL: End-to-End Topological Learning with 2-parameter Persistencecited by 5
- 2014The rank invariant stability via interleavingscited by 4
- 2026A Closed-Form Persistence-Landmark Pipeline for Certified Point-Cloud and Graph Classificationcited by 3
- 2026Statistical Inference for Persistence Diagrams via Landmark Embeddings: Minimax Theory and Finite Approximationcited by 3
- 2018Computing the interleaving distance is NP-hardcited by 2
- 2018Exact computation of the matching distance on 2-parameter persistence modulescited by 2
- 2026A Closed-Form Adaptive-Landmark Kernel for Certified Point-Cloud and Graph Classificationcited by 2
Built on by
Not cited yet.