mlsanityData to 7 Oct 2026

A Closed-Form Persistence-Landmark Pipeline for Certified Point-Cloud and Graph Classification

arXiv 2605.02836 ↗First posted 4 May 2026cs.LG math.ATcited by 3

Not on the map. Why?

Abstract (arXiv)

We introduce PLACE (Persistence-Landmark Analytic Classification Engine), a closed-form pipeline for classifying point clouds and graphs through their persistent-homology signatures. Three quantitative guarantees -- a margin-based excess-risk rate, a closed-form descriptor-selection rule, and a per-prediction certificate -- are derived from training labels alone, with no learned weights or held-out calibration. The embedding sums Mitra-Virk single-point coordinate functions over a sparse landmark grid; the closed-form weight rule wk2 propto (dk+12 - dk2)/Rk2 maximizes the distortion slope in Mitra-Virk's affine certificate under nu-coherence. (i) An O(kR/(Delta√mmin)) margin bound, driven by class-mean separation Delta and embedding radius R, matched in the sample-starved regime m lesssim R/Delta by a Le Cam minimax lower bound. (ii) The Mahalanobis margin under Ledoit-Wolf-shrunk covariance is the strongest closed-form ranker on a 64-descriptor chemical-graph pool (mean Spearman ρ = +0.56 across 11 benchmarks, positive on 10 of 11); the isotropic surrogate Delta/√ℓ admits a closed-form selection-consistency rate on the homogeneous protein/social pools. (iii) A training-time-decided certificate, with no per-prediction overhead, in three concrete radii (Pinelis, Gaussian plug-in, and variance-aware Pinelis-Bernstein). Empirically, PLACE is the strongest diagram-based method on Orbit5k and matches the strongest topology-based baseline within statistical noise on MUTAG and COX2; remaining gaps fall into two diagnosable regimes (descriptor blindness on NCI1/NCI109; pool-coverage limits elsewhere). The Pinelis-Bernstein radius fires on 8 of the 12 benchmarks; on MUTAG the empirical and population nearest-centroid rules agree on every one of 940 held-out test predictions, validating the certificate's mechanism.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 18 of its 47 references that are in the map. First posted on arXiv 4 May 2026.

Builds on

18 of 47 references.

References · 18

  1. 2018How Powerful are Graph Neural Networks?cited by 4,355
  2. 2017Selective Classification for Deep Neural Networkscited by 799
  3. 2016Distribution-Free Predictive Inference For Regressioncited by 657
  4. 2015An Introduction to Matrix Concentration Inequalitiescited by 391
  5. 2015Persistence Images: A Stable Vector Representation of Persistent Homologycited by 235
  6. 2019PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signaturescited by 125
  7. 2017Deep Learning with Topological Signaturescited by 113
  8. 2019A Topology Layer for Machine Learningcited by 79
  9. 2017Sliced Wasserstein Kernel for Persistence Diagramscited by 77
  10. 2019Learning metrics for persistence-based summaries and applications for graph classificationcited by 57
  11. 2018Persistence Fisher Kernel: A Riemannian Manifold Kernel for Persistence Diagramscited by 33
  12. 2018RetGK: Graph Kernels based on Return Probabilities of Random Walkscited by 32
6 more
  1. 2021Persformer: A Transformer Architecture for Topological Machine Learningcited by 19
  2. 2023Differentiable Euler Characteristic Transforms for Shape Classificationcited by 18
  3. 2018DTM-based Filtrationscited by 16
  4. 2023Euler Characteristic Tools For Topological Data Analysiscited by 13
  5. 2019Embeddings of Persistence Diagrams into Hilbert Spacescited by 11
  6. 2018On the Metric Distortion of Embedding Persistence Diagrams into separable Hilbert spacescited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.