惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

S
SegmentFault 最新的问题
爱范儿
爱范儿
博客园 - 三生石上(FineUI控件)
Microsoft Security Blog
Microsoft Security Blog
Google DeepMind News
Google DeepMind News
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
GbyAI
GbyAI
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
V
V2EX
酷 壳 – CoolShell
酷 壳 – CoolShell
量子位
博客园_首页
T
Tailwind CSS Blog
aimingoo的专栏
aimingoo的专栏
A
About on SuperTechFans
T
The Blog of Author Tim Ferriss
Stack Overflow Blog
Stack Overflow Blog
Recent Announcements
Recent Announcements
P
Proofpoint News Feed
博客园 - 司徒正美
有赞技术团队
有赞技术团队
Engineering at Meta
Engineering at Meta
Last Week in AI
Last Week in AI
MongoDB | Blog
MongoDB | Blog

stat updates on arXiv.org

Simultaneous Monitoring of Shape and Surface Color via 4D Point Clouds: A Registration-free Approach A Refined Generalization Analysis for Extreme Multi-class Supervised Contrastive Representation Learning Ensemble Distributionally Robust Bayesian Optimisation The Proxy Presumption: From Semantic Embeddings to Valid Social Measures Modulated learning for private and distributed regression with just a single sample per client device Query-efficient model evaluation using cached responses Functional-prior-based approaches to Bayesian PDE-constrained inversion using physics-informed neural networks Optimal Experiments for Partial Causal Effect Identification Order-Agnostic Autoregressive Modelling with Missing Data Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Tuning Derivatives for Causal Fairness in Machine Learning Spherical Flows for Sampling Categorical Data Bayesian Rain Field Reconstruction using Commercial Microwave Links and Diffusion Model Priors GRALIS: A Unified Canonical Framework for Linear Attribution Methods via Riesz Representation Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning Jacobian-Velocity Bounds for Deployment Risk Under Covariate Drift Self-Attention as Transport: Limits of Symmetric Spectral Diagnostics Perturbation is All You Need for Extrapolating Language Models Adapt or Forget: Provable Tradeoffs Between Adam and SGD in Nonstationary Optimization Realizable Bayes-Consistency for General Metric Losses Graph Convolutional Support Vector Regression for Robust Spatiotemporal Forecasting of Urban Air Pollution Segmenting Human-LLM Co-authored Text via Change Point Detection Stochastic Schrödinger Diffusion Models for Pure-State Ensemble Generation Understanding Self-Supervised Learning via Latent Distribution Matching The Geometric Mechanics of Contrastive Representation Learning: Alignment Potentials, Entropic Dispersion, and Cross-modal Divergence Imbalanced Classification under Capacity Constraints On the Spectral Structure and Objective Equivalence of Orthogonal Multilabel Fisher Discriminants Partially Observed Structural Causal Models First-Order Efficiency for Probabilistic Value Estimation via A Statistical Viewpoint
Finite-sample certification and operating envelopes for s...
[Submitted on 11 Feb 2026 (v1), last revised 29 Jul 2026 (this v · 2026-02-11 · via stat updates on arXiv.org

View PDF HTML (experimental)

Abstract:Spectral clustering and node rankings are commonly reported from one observed network without a finite-sample statement of what the observation supports. We develop a certification protocol that either returns a coverage-guaranteed set or explicitly returns ``no nontrivial certificate.'' For an inhomogeneous Bernoulli graph, a matrix-Bernstein quantile with all numerical constants and its ambient-dimension factor retained is combined with a one-sided spectral-gap certificate. The resulting Grassmann ball is valid at finite \(n\), but is reported as informative only when its radius is below the
diameter of the Grassmannian. We propagate the ball through a
certificate-bearing approximate \(k\)-means map under declared population
separation and minimum-cluster envelopes, derive simultaneous bands and an observed-gap certificate for degree centrality, and give a corrected normalized-Katz extension. A \(12\)-cell simulation study with \(1{,}000\) graphs per cell maps the difference between coverage and usefulness. The submitted \(n=200\) block-model example is shown to be necessarily vacuous after the dimension factor is restored; in the benchmark \(p=0.30,q=0.10\), the
subspace radius first falls below one at
\(n=\ExactRadiusThreshold\), whereas the mean-square clustering certificate
remains unavailable until \(n=\HammingThreshold\). An unequal-block example produces a genuine centrality certificate, while an analysis of the Zachary karate-club network correctly declines to certify despite \(97.1\%\) agreement with the observed factions. These results separate algorithmic success, coverage validity and inferential informativeness.

Submission history

From: Chandrasekhar Gokavarapu [view email]
[v1] Wed, 11 Feb 2026 06:35:08 UTC (36 KB)
[v2] Wed, 29 Jul 2026 15:41:56 UTC (114 KB)