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

推荐订阅源

T
Tailwind CSS Blog
The GitHub Blog
The GitHub Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
B
Blog
Microsoft Security Blog
Microsoft Security Blog
Stack Overflow Blog
Stack Overflow Blog
量
量子位
Martin Fowler
Martin Fowler
月光博客
月光博客
P
Proofpoint News Feed
博
博客园_首页
Y
Y Combinator Blog
I
InfoQ
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
V
Visual Studio Blog
H
Help Net Security
U
Unit 42
GbyAI
GbyAI
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博
博客园 - 司徒正美
MongoDB | Blog
MongoDB | Blog
F
Fortinet All Blogs
罗
罗磊的独立博客
酷 壳 – CoolShell
酷 壳 – CoolShell

stat updates on arXiv.org

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 Robust and Fast Training via Per-Sample Clipping
Geometric bias in eigenspace perturbation under random he...
[Submitted on 9 Jun 2026 (v1), last revised 25 Aug 2026 (this ve · 2026-06-09 · via stat updates on arXiv.org

View PDF HTML (experimental)

Abstract:Spectral methods rely on the stability of principal eigenspaces under random perturbations. Classically, this is quantified by the Davis-Kahan and Wedin theorems, which bound the eigenspace error via the operator norm of the noise and the relevant spectral gaps. While sharp for arbitrary deterministic perturbations, these worst-case bounds can be wasteful in the low-rank signal-plus-noise setting, as they fail to capture the interaction between the signal geometry and the noise distribution. We study the spectral perturbation of signal-plus-noise matrices corrupted by sparse random noise with an arbitrary, inhomogeneous variance profile. Under heterogeneous variances, the empirical eigenvectors suffer a systematic, deterministic geometric bias invisible to classical bounds. Leveraging the Quadratic Vector Equation (QVE) and fine-grained isotropic local laws, we derive near-optimal, non-asymptotic bounds for the leading eigenspaces in the operator and 2-to-infinity norms. These separate the usual signal-to-noise contribution, stochastic fluctuations, and structured geometric bias terms determined by the alignment between the signal eigenspaces and the row-wise variance profile. We further develop refined rowwise bounds that adapt to the variance-weighted leverage of the signal space, yielding sharper guarantees in delocalized regimes.
As applications, we establish strong consistency of adjacency spectral clustering for degree-corrected stochastic block models with heterogeneous degrees and unbalanced communities, recovering the logarithmic expected-degree scale in the regular balanced case. We also study spectral embedding for generalized random dot product graphs, showing that the full signal embedding admits sharp rowwise control, whereas spectral truncation can retain a systematic geometric bias determined by the omitted signal directions and the variance profile.

Submission history

From: Ke Wang [view email]
[v1] Tue, 9 Jun 2026 03:50:14 UTC (310 KB)
[v2] Tue, 25 Aug 2026 15:07:06 UTC (351 KB)

此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。