A randomized algorithm for principal component analysis
arXiv:0809.2274
Abstract
Principal component analysis (PCA) requires the computation of a low-rank approximation to a matrix containing the data being analyzed. In many applications of PCA, the best possible accuracy of any rank-deficient approximation is at most a few digits (measured in the spectral norm, relative to the spectral norm of the matrix being approximated). In such circumstances, efficient algorithms have not come with guarantees of good accuracy, unless one or both dimensions of the matrix being approximated are small. We describe an efficient algorithm for the low-rank approximation of matrices that produces accuracy very close to the best possible, for matrices of arbitrary sizes. We illustrate our theoretical results via several numerical examples.
26 pages, 6 tables, 1 figure; to appear in the SIAM Journal on Matrix Analysis and Applications
Cited by in corpus (6)
- Fast non-negative deconvolution for spike train inference from population calcium imaging
- Randomized Matrix Decompositions using R
- Randomized Nonnegative Matrix Factorization
- Stochastic Subsampling for Factorizing Huge Matrices
- Projection-based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices
- Randomized methods to characterize large-scale vortical flow network