arXiv:2606. 00500v1 Announce Type: cross Abstract: We present a simple and efficient algorithm for robust approximate message passing (AMP) in the spiked matrix setting.
By Misha Ivkov, Tselil Schramm
arXiv:2606. 11263v1 Announce Type: cross Abstract: Spectral methods rely fundamentally on the stability of principal eigenspaces under random perturbations.
By Fengkai Liu, Ke Wang, Wanjie Wang
arXiv:2607. 14304v1 Announce Type: cross Abstract: We study sparse random geometric graphs generated by connecting pairs of high-dimensional vectors whose inner product exceeds a threshold.
By Manuel Fernandez V, Yizhe Zhu
arXiv:2602. 03682v2 Announce Type: replace-cross Abstract: We analyze the Accelerated Noisy Power Method, an algorithm for Principal Component Analysis in the setting where only inexact matrix-vector products are available, which can arise for instance in decentralized PCA.
By Pierre Agui\'e, Mathieu Even, Laurent Massouli\'e
arXiv:2603. 11308v3 Announce Type: replace Abstract: Principal Component Analysis (PCA) is a cornerstone of dimensionality reduction, yet its classical formulation relies critically on second-order moments and is therefore fragile in the presence of heavy-tailed data and impulsive noise.
By Mario Sayde, Christopher Khater, Jihad Fahs, Ibrahim Abou-Faycal
arXiv:2505. 10882v2 Announce Type: replace Abstract: Principal component analysis classically requires full $d$-dimensional samples, yet in various applications hardware limits acquisition to a few scalar measurements per sample.
By Alex Saad-Falcon, Brighton Ancelin, Justin Romberg