Shifted Randomized Singular Value Decomposition
2019-11-26Code Available0· sign in to hype
Ali Basirat
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/abasirat/Shifted-Randomized-SVDOfficialnone★ 0
Abstract
We extend the randomized singular value decomposition (SVD) algorithm Halko2011finding to estimate the SVD of a shifted data matrix without explicitly constructing the matrix in the memory. With no loss in the accuracy of the original algorithm, the extended algorithm provides for a more efficient way of matrix factorization. The algorithm facilitates the low-rank approximation and principal component analysis (PCA) of off-center data matrices. When applied to different types of data matrices, our experimental results confirm the advantages of the extensions made to the original algorithm.