Sublinear Cost Low Rank Approximation via Subspace Sampling

DOI10.1007/978-3-030-43120-4_9OpenAlexW3012415416MaRDI QIDQ5014667FDOQ5014667

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

Recommendations

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

zbMATH Keywords

low-rank approximationsubspace samplingsublinear cost

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
• Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
• Low-rank signal subspace: parameterization, projection and signal estimation
• Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
• Adaptive iterative Hessian sketch via \(A\)-optimal subsampling
• Title not available (Why is that?)

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)