cs.LGMay 4, 2026

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

Authors: Sushovan MajhiAtish MitraŽiga VirkPramita Bagchi

Organizations: Data Science, George Washington University, USA · Department of Mathematical Sciences, Montana Technological University, USA · Faculty of Computer and Information Science, University of Ljubljana, Institute IMFM, Slovenia · Biostatistics and Bioinformatics, George Washington University, USA

Abstract

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(dk+12dk2)/Rk2w_k^2 \propto (d_{k+1}^2 - d_k^2)/R_k^2 maximizes the distortion slope in Mitra-Virk's affine certificate under νν-coherence. (i) An O(kR/(Δmmin))O(kR/(Δ\sqrt{m_{\min}})) margin bound, driven by class-mean separation ΔΔ and embedding radius RR, matched in the sample-starved regime mR/Δm \lesssim R/Δ 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ρ= +0.56 across 11 benchmarks, positive on 10 of 11); the isotropic surrogate Δ/Δ/\sqrt{\ell} 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.

Explore similar work

May 5, 2026cs.LG

A Closed-Form Adaptive-Landmark Kernel for Certified Point-Cloud and Graph Classification

We introduce PALACE (Persistence Adaptive-Landmark Analytic Classification Engine), the data-adaptive companion to PLACE, paying a small cross-validation tier on three knobs (budget, radii, bandwidth; 5\leq 5 choices each). A cover-theoretic core (Lebesgue-number criterion on the landmark cover) yields four closed-form guarantees. (i) A structural lower distortion bound λ(τ;ν)λ(τ;ν) on Dn\mathcal{D}_n under cross-diagram non-interference, with a (D/L)2(D/L)^2 budget reduction over the uniform grid when diagrams concentrate. (ii) Equal weights wk=K1/2w_k = K^{-1/2} maximizing λλ, and farthest-point-sampling positions 22-approximating the optimal kk-center covering radius; both derived from training labels alone, no gradient training. (iii) A kernel-RKHS classification rate O((k1)K/(γmmin))O((k-1)\sqrt{K}/(γ\sqrt{m_{\min}})) with binary necessity threshold m=Ω(K/γ)m = Ω(\sqrt K/γ) from a matching Le Cam lower bound, and a closed-form filtration-selection rule. The kernel-Mahalanobis margin ρ^Mah\hatρ_{\mathrm{Mah}} is the strongest closed-form ranker across the chemical-graph pool (mean Spearman ρ+0.60ρ\approx +0.60); the isotropic surrogate γ^/K\hatγ/\sqrt{K} admits a selection-consistency rate, and λ^\widehatλ from (i) provides an independent data-level signal (positive on COX2 and PTC). (iv) A per-prediction certificate, in non-asymptotic Pinelis and asymptotic Gaussian forms, with no calibration split. Empirically, PALACE is the strongest closed-form diagram-based method on Orbit5k (91.3±1.0%91.3 \pm 1.0\%, matching Persformer), leads every diagram-based competitor on COX2 and MUTAG, and is competitive on DHFR (within 1 pp of ECP). At 8×8\times domain inflation, adaptive placement maintains 94%94\% while the uniform grid collapses to chance (25%25\% on 4-class data).
Sushovan Majhi, Atish Mitra, Žiga Virk +1
Sep 7, 2026cs.LG

Heat Field Signatures: From Point Clouds to Smooth Geometry

Bringing multiscale geometric analysis directly to irregular point clouds remains difficult: quantities such as local dimension, anisotropy, density variation, and geometric transitions are typically estimated through explicit neighborhood, manifold, or graph constructions, or left for neural networks to infer from coordinates. We introduce Heat Field Signatures (HFS), which lift a point cloud to a multiscale family of smooth ambient heat fields, providing a direct interface from discrete samples to geometric analysis. From this field, HFS computes closed-form global and local signatures directly from pairwise distances, capturing heat concentration, intrinsic dimension, anisotropy, and scale transitions. We further introduce the Heat Dimension Spectrum (HDS), a compact summary of multiscale geometric composition. HFS can be used as a closed-form descriptor, a lightweight learned representation, or a geometric feature channel for neural point-cloud models. Across synthetic and real-world benchmarks spanning subcellular, neuronal, tree, and protein data, HFS outperforms strong point-cloud and multiparameter-persistence baselines while substantially reducing end-to-end cost. On SCOP protein-fold classification, HFS improves over the strongest deep baseline by nearly 2424 percentage points using coordinates alone, while standalone HFS representations are exactly rotation-invariant by construction. More broadly, HFS turns a classical heat field into a practical interface for multiscale geometric analysis in modern point-cloud learning.
Yuanqing Wang, Yapeng Tian, Baris Coskunuzer
Jun 30, 2026cs.GR

Benchmarking Federated Learning and Knowledge Distillation for Point Cloud Classification

Deploying 3D point cloud analysis in privacy-sensitive, resource-constrained settings faces two barriers: data cannot be centralized, and models must run on limited edge hardware. We present a multi-seed benchmark jointly evaluating federated learning (FL) and knowledge distillation (KD) for 3D point cloud classification. It spans 13 FL algorithms and 10 KD objectives (a 130-pair cross-product) across 504 training runs, evaluated on ModelNet40 and a clinical craniosynostosis dataset. We report three findings. First, under extreme non-IID label skew, standalone FL degrades sharply: on ModelNet40, the strongest method reaches 76.32% against a 92.26% centralized reference; on clinical data, the best reaches 75.83% against 100%. Second, distillation successfully compresses the teacher into a student 74.51% smaller and roughly twice as fast at inference, often matching or surpassing the teacher. Third, the combined pipeline exposes an evaluation pitfall: when distillation keeps a hard-label cross-entropy term on a labeled proxy split, a collapsed federated teacher (8.50%) paired with Logit-MSE still yields a 92.94% student. This 84.4-point gap reflects the proxy labels rather than the federated model, reusing the very labels whose privacy motivated federation. Objectives without hard labels instead track teacher quality (r0.99r \approx 0.99) and collapse when the teacher does. We therefore recommend evaluating FL-KD pipelines with label-free distillation so reported accuracy reflects the federated teacher, not the proxy.
Aizierjiang Aiersilan