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

推荐订阅源

Recent Announcements
Recent Announcements
V
V2EX
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 聂微东
爱范儿
爱范儿
Jina AI
Jina AI
博客园 - Franky
IT之家
IT之家
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
T
Tailwind CSS Blog
博客园 - 三生石上(FineUI控件)
The Cloudflare Blog
M
MIT News - Artificial intelligence
aimingoo的专栏
aimingoo的专栏
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
J
Java Code Geeks
人人都是产品经理
人人都是产品经理
腾讯CDC
博客园_首页
月光博客
月光博客
有赞技术团队
有赞技术团队
C
Check Point Blog
Microsoft Security Blog
Microsoft Security Blog
MyScale Blog
MyScale Blog

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
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 math 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)