AI & ML
Sparse corruption in low-rank matrix inference: the PCA benchmark
arXiv stat.ML0 views
arXiv:2511.11927v3 Announce Type: replace Abstract: Principal Component Analysis (PCA) is a standard tool for extracting a low-rank signal from noisy observations. It is known that when applying PCA to a rank-one signal corrupted by a dense, homogeneous noise, in the large matrix size limit, the BBP transition occurs, where the emergence of an outlying eigenvalue and the alignment of the corresponding eigenvector occur at the same critical signal strength. Here we study the case of sparse noise corruption. The noise matrix is modelled as the adjacency matrix of a weighted undirected graph with finite average connectivity. Using the replica method, we analytically compute the typical top eigenvalue, the top eigenvector component density, and the overlap with the signal, through recursive distributional equations solved by population dynamics. We identify two signal-strength transitions as functions of graph connectivity: $\theta_{\rm crit}$, marking signal recovery by the top eigenvector and generalising the BBP transition, and $\theta_{\rm b}$, where the signal-related eigenvalue detaches from the bulk. For noise with nonzero mean, these transitions need not coincide because of a structural sparse-graph outlier, leading to a discontinuous transition in the overlap with the top eigenvector. For a Random Regular degree distribution, we obtain exact closed-form expressions for both thresholds, the signal eigenvalue and the squared overlap, and show that the same formulas also predict the overlap of the signal with the second eigenvector in the intermediate regime $\theta_{\rm b}<\theta\leq \theta_{\rm crit}$. For a Poissonian degree distribution, an approximate closure of the recursions yields fast and accurate predictions in the recovery phase that agree with exact results from population dynamics. We also recover dense-noise results in the large-connectivity limit, and validate the theory by numerical diagonalisation of large matrices.
Source:https://arxiv.org/abs/2511.11927PreviousSurvival of the fittest Cox model: Pivotal variable selection for time-to-event dataNextAnytime-Valid Conformal Risk Control
Related posts
Why an Embedded Game Fails on Some Phones, and How to Debug It
0dev.to
Microsoft 365 vs Office 2024: The Break-Even Math
0dev.to
Master AI Evals: Build Reliable, Scalable Model Evaluation Pipelines
0dev.to
What to give someone who misses a place
0dev.to
Google is pushing OEMs against GrapheneOS and bootloader unlocking
0Hacker News
VESTA: Visual Exploration with Statistical Tool Agents
0arXiv stat.CO