Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions

Abstract

Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which demonstrates that randomization offers a powerful tool for performing low-rank matrix approximation. These techniques exploit modern computational architectures more fully than classical methods and open the possibility of dealing with truly massive data sets. This paper presents a modular framework for constructing randomized algorithms that compute partial matrix decompositions. These methods use random sampling to identify a subspace that captures most of the action of a matrix. The input matrix is then compressed---either explicitly or implicitly---to this subspace, and the reduced matrix is manipulated deterministically to obtain the desired low-rank factorization. In many cases, this approach beats its classical competitors in terms of accuracy, speed, and robustness. These claims are supported by extensive numerical experiments and a detailed error analysis.

Cited by in corpus (15)

• Knowledge Graph informed Fake News Classification via Heterogeneous Representation Ensembles
• Convergence rates of sub-sampled Newton methods
• Provably Consistent Partial-Label Learning
• ivis Dimensionality Reduction Framework for Biomacromolecular Simulations
• Fast Matrix Square Roots with Applications to Gaussian Processes and Bayesian Optimization
• Sweeping Preconditioner for the Helmholtz Equation: Hierarchical Matrix Representation
• ACCAMS: Additive Co-Clustering to Approximate Matrices Succinctly
• Data adaptation in HANDY economy-ideology model
• Bilateral Random Projections
• In Search of a Fast and Efficient Serverless DAG Engine
• Generalized Self-Concordant Functions: A Recipe for Newton-Type Methods
• Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
• Random Projections and Dimension Reduction
• Fast clustering for scalable statistical analysis on structured images
• The Stability of the First Neumann Laplacian Eigenfunction Under Domain Deformations and Applications