AI & ML
Where Do Two Populations of Persistence Diagrams Differ? Calibrated Local Inference at a Fixed Budget
arXiv stat.TH0 views
arXiv:2610.08292v1 Announce Type: cross Abstract: Many two-sample tests for populations of persistence diagrams assess global differences without identifying the regions of the birth-death plane that contribute to them. We study simultaneous inference for local mean contrasts when the number of available diagrams is fixed. They are differences in expected weighted feature mass within $\ell_\infty$ neighborhoods at several centers and radii. We estimate these contrasts using additive landmark responses. A Gaussian multiplier bootstrap calibrates simultaneous confidence intervals while allowing unequal group covariances. The neighborhoods whose intervals exclude zero form a map with approximate family-wise error control, and selecting a subset of original intervals for display preserves their joint coverage guarantee. On the simultaneous coverage event, every reported neighborhood lies within twice its radius of the support of the mean-measure difference. A geometric result gives sufficient radius conditions for a displaced feature to produce a nonzero contrast. A comparison of sufficient detection thresholds quantifies the tradeoff between reducing the number of tested coordinates and reserving observations for an independent pilot. In simulations with 40 to 120 diagrams per class, the bands achieved 94%-98% simultaneous coverage under both the strict null and equal means with unequal covariances. In the latter setting, a permutation maximum and the pooled-t implementation of the two-stage persistence-image test of Moon and Lazar rejected in up to 32% and 26% of runs, respectively. In the fixed-budget simulations, spending a third of the observations on a pilot to choose landmarks or radii located changes less often than a prespecified grid at a single radius. On the MUTAG benchmark, the localized region concentrates on rings of fused-ring systems, an exploratory reading.
Source:https://arxiv.org/abs/2610.08292PreviousEfficient Posterior Sampling for $\mathbb Z_2$ SynchronizationNextSharp detection thresholds for random geometric graphs with polynomial average degrees
Related posts
Sharp Non-Asymptotic Analysis of the Penalized Challenger in $\beta$-EB-TCI for Bernoulli Bandits
0arXiv stat.ML
Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary
0arXiv stat.ML
Spectral Condition for $\mu$P under Width-Depth Scaling
0arXiv stat.ML
A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems
0arXiv stat.ML
Who Gets Watched? Allocating Scarce Escalation Resources on Pediatric Wards with Neural Index Policies
0arXiv stat.ML
Minimax Alternating Regret for the Experts Problem and Online Convex Optimization
0arXiv stat.ML