Adaptive Sampling and Fast Low-Rank Matrix Approximation
From MaRDI portal
Recommendations
- A fast and efficient algorithm for low-rank approximation of a matrix
- Fast monte-carlo algorithms for finding low-rank approximations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
- Fast computation of low rank matrix approximations
Cited in
(61)- A Local Search Framework for Experimental Design
- Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows
- Low rank approximation in the presence of outliers
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- scientific article; zbMATH DE number 7307477 (Why is no real title available?)
- Fast computation of low rank matrix approximations
- _p row sampling by Lewis weights
- Tighter low-rank approximation via sampling the leveraged element
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- Column subset selection problem is UG-hard
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Lower bounds for column matrix approximations
- Sublinear Cost Low Rank Approximation via Subspace Sampling
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- Low rank approximation of binary matrices: column subset selection and generalizations
- Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
- Testing matrix rank, optimally
- Accuracy and stability of CUR decompositions with oversampling
- On the optimality of Voronoi-based column selection
- Optimal column-based low-rank matrix reconstruction
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition
- Least squares approximations of measures via geometric condition numbers
- A Fast Random Sampling Algorithm for Sparsifying Matrices
- Proportional volume sampling and approximation algorithms for \(A\)-optimal design
- Fast multiple rank-constrained matrix approximation
- Frequent directions: simple and deterministic matrix sketching
- Perfect \(L_p\) sampling in a data stream
- Online row sampling
- On the accuracy of cross and column low-rank maxvol approximations in average
- On selecting a maximum volume sub-matrix of a matrix and related problems
- A fast and efficient algorithm for low-rank approximation of a matrix
- Online row sampling
- Subspace method of moments for \textit{ab initio} 3-D single particle cryo-EM reconstruction
- Sampling based succinct matrix approximation
- scientific article; zbMATH DE number 7008333 (Why is no real title available?)
- A note on linear function approximation using random projections
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite-element matrices
- An extended ADMM for 3-block nonconvex nonseparable problems with applications
- Input sparsity time low-rank approximation via ridge leverage score sampling
- Column subset selection via sparse approximation of SVD
- Learning big (image) data via coresets for dictionaries
- Embrace rejection: kernel matrix approximation by accelerated randomly pivoted Cholesky
- A fast block low-rank dense solver with applications to finite-element matrices
- Literature survey on low rank approximation of matrices
- On the existence of a close to optimal cross approximation in the Frobenius norm
- Matrix recipes for hard thresholding methods
- New subset selection algorithms for low rank approximation: offline and online
- Turning big data into tiny data: coresets for unsupervised learning problems
- Low rank matrix-valued Chernoff bounds and approximate matrix multiplication
- Sampling-based dimension reduction for subspace approximation with outliers
- Relative errors for deterministic low-rank matrix approximations
- Efficient subspace approximation algorithms
- Streaming low-rank matrix approximation with an application to scientific simulation
- Matrix approximation and projective clustering via volume sampling
- Effective implementation to reduce execution time of a low-rank matrix approximation problem
- Robust blockwise random pivoting: fast and accurate adaptive interpolative decomposition
- Randomized algorithms in numerical linear algebra
- Exponential inapproximability of selecting a maximum volume sub-matrix
This page was built for publication: Adaptive Sampling and Fast Low-Rank Matrix Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595389)
