Sublinear Cost Low Rank Approximation via Subspace Sampling

DOI10.1007/978-3-030-43120-4_9MaRDI QIDQ5014667zbMATH OpenOpenAlexFDO

Authors

Publication date 8 December 2021

Published in Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-43120-4_9

zbMATH Keywords

low-rank approximationsublinear costsubspace sampling

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Recommendations

• CUR LRA at Sublinear Cost Based on Volume Maximization
• Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
• Adaptive Sampling and Fast Low-Rank Matrix Approximation

Cites work

• A fast randomized algorithm for the approximation of matrices
• Condition Numbers of Gaussian Random Matrices
• Eigenvalues and Condition Numbers of Random Matrices
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• How to find a good submatrix
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• Improved analysis of the subsampled randomized Hadamard transform
• Literature survey on low rank approximation of matrices
• Local operator theory, random matrices and Banach spaces.
• New studies of randomized augmentation and additive preprocessing
• Numerical methods in matrix computations
• Numerically safe Gaussian elimination with no pivoting
• On the existence and computation of rank-revealing LU factorizations
• Practical sketching algorithms for low-rank matrix approximation
• Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
• Randomized Algorithms for Matrices and Data
• Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
• Tails of Condition Number Distributions
• Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions

Cited in

(7)

• Low-rank signal subspace: parameterization, projection and signal estimation
• Adaptive iterative Hessian sketch via A-optimal subsampling
• Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
• CUR LRA at Sublinear Cost Based on Volume Maximization
• scientific article; zbMATH DE number 7164743 (Why is no real title available?)
• Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
• Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares

This page was built for publication: Sublinear Cost Low Rank Approximation via Subspace Sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014667)