paper-with-me

홈 › Papers

Extreme value theory for singular subspace estimation in the matrix denoising model

2025-07-26 · Junhyung Chang, Joshua Cape arxiv

This paper studies fine-grained singular subspace estimation in the matrix denoising model where a deterministic low-rank signal matrix is additively perturbed by a stochastic matrix of Gaussian noise. We establish that the maximum Euclidean row norm (i.e., the two-to-infinity norm) of the aligned difference between the leading sample and population singular vectors approaches the Gumbel distribution in the large-matrix limit, under suitable signal-to-noise conditions and after appropriate centering and scaling. We apply our novel asymptotic distributional theory to test hypotheses of low-rank signal structure encoded in the leading singular vectors and their corresponding principal subspace. We provide de-biased estimators for the corresponding nuisance signal singular values and show that our proposed plug-in test statistic has desirable properties. Notably, compared to using the Frobenius norm subspace distance, our test statistic based on the two-to-infinity norm empirically has higher power to detect structured alternatives that differ from the null in only a few matrix entries or rows. Our main results are obtained by a novel synthesis of and technical analysis involving row-wise matrix perturbation analysis, extreme value theory, saddle point approximation methods, and random matrix theory. Our contributions complement the existing literature for matrix denoising focused on minimaxity, mean squared error analysis, unitarily invariant distances between subspaces, component-wise asymptotic distributional theory, and row-wise uniform error bounds. Numerical simulations illustrate our main results and demonstrate the robustness properties of our testing procedure to non-Gaussian noise distributions.

📄 PDF Abstract BibTeX arXiv:2507.19978

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Optimal Estimation of Shared Singular Subspaces across Multiple Noisy Matrices

2024-11-26 · Zhengchi Ma, Rong Ma

Estimating singular subspaces from noisy matrices is a fundamental problem with wide-ranging applications across various fields. Driven by the challenges of data integration and multi-view analysis, this study focuses on…

Data IntegrationDenoising

Generalized Grade-of-Membership Estimation for High-dimensional Locally Dependent Data

2024-12-27 · Ling Chen, Chengzhu Huang, Yuqi Gu

This work focuses on the mixed membership models for multivariate categorical data widely used for analyzing survey responses and population genetics data. These grade of membership (GoM) models offer rich modeling power…

Evaluating Singular Value Thresholds for DNN Weight Matrices based on Random Matrix Theory

2025-12-15 · Kohei Nishikawa, Koki Shimizu, Hiroki Hashiguchi arxiv

This study evaluates thresholds for removing singular values from singular value decomposition-based low-rank approximations of deep neural network weight matrices. Each weight matrix is modeled as the sum of signal and …

Joint Bayesian estimation of close subspaces from noisy measurements

2013-10-01 · Olivier Besson, Nicolas Dobigeon, Jean-Yves Tourneret

In this letter, we consider two sets of observations defined as subspace signals embedded in noise and we wish to analyze the distance between these two subspaces. The latter entails evaluating the angles between the sub…

Accurate and fast matrix factorization for low-rank learning

2021-04-21 · Reza Godaz, Reza Monsefi, Faezeh Toutounian, Reshad Hosseini

In this paper, we tackle two important problems in low-rank learning, which are partial singular value decomposition and numerical rank estimation of huge matrices. By using the concepts of Krylov subspaces such as Golub…

Matrix Factorization / DecompositionRiemannian optimization