An implementation of a randomized algorithm for principal component analysis
arXiv:1412.3510
Abstract
Recent years have witnessed intense development of randomized methods for low-rank approximation. These methods target principal component analysis (PCA) and the calculation of truncated singular value decompositions (SVD). The present paper presents an essentially black-box, fool-proof implementation for Mathworks' MATLAB, a popular software platform for numerical computation. As illustrated via several tests, the randomized algorithms for low-rank approximation outperform or at least match the classical techniques (such as Lanczos iterations) in basically all respects: accuracy, computational efficiency (both speed and memory usage), ease-of-use, parallelizability, and reliability. However, the classical procedures remain the methods of choice for estimating spectral norms, and are far superior for calculating the least singular values and corresponding singular vectors (or singular subspaces).
13 pages, 4 figures
Cited by in corpus (11)
- Randomized Matrix Decompositions using R
- Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition
- Randomized Nonnegative Matrix Factorization
- AutoQML: Automatic Generation and Training of Robust Quantum-Inspired Classifiers by Using Genetic Algorithms on Grayscale Images
- Randomized Truncated SVD Levenberg-Marquardt Approach to Geothermal Natural State and History Matching
- POD-DL-ROM: enhancing deep learning-based reduced order models for nonlinear parametrized PDEs by proper orthogonal decomposition
- Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
- Integrating multiple random sketches for singular value decomposition
- Reduced-Rank Regression with Operator Norm Error
- Angular Embedding: A New Angular Robust Principal Component Analysis
- Local Search Algorithms for Rank-Constrained Convex Optimization