Fast computation of low rank matrix approximations
From MaRDI portal
Publication:5176019
Recommendations
- Fast monte-carlo algorithms for finding low-rank approximations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast low rank approximations of matrices and tensors
- A fast and efficient algorithm for low-rank approximation of a matrix
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
Cites work
Cited in
(46)- scientific article; zbMATH DE number 7049740 (Why is no real title available?)
- Fast Estimation of Approximate Matrix Ranks Using Spectral Densities
- Generalized low rank approximations of matrices
- Less is More: Sparse Graph Mining with Compact Matrix Decomposition
- Far-field compression for fast kernel summation methods in high dimensions
- Stochastic boundary methods of fundamental solutions for solving PDEs
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Quantum recommendation systems
- Low-rank approximation of a matrix: novel insights, new progress, and extensions
- Tighter low-rank approximation via sampling the leveraged element
- Singular value decomposition of large random matrices (for two-way classification of microarrays)
- Randomized numerical linear algebra: Foundations and algorithms
- Matrix estimation by universal singular value thresholding
- Noisy random graphs and their laplacians
- A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
- Recognizing linear structure in noisy matrices
- On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods.
- \textit{ScreeNOT}: exact MSE-optimal singular value thresholding in correlated noise
- Low-Rank Matrix Approximation Using Point-Wise Operators
- Separating populations with wide data: a spectral analysis
- Frequent directions: simple and deterministic matrix sketching
- Sampling and multilevel coarsening algorithms for fast matrix approximations.
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- A fast and efficient algorithm for low-rank approximation of a matrix
- Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
- Practical sketching algorithms for low-rank matrix approximation
- Random walk with restart: fast solutions and applications
- Sampling based succinct matrix approximation
- Fast low-rank modifications of the thin singular value decomposition
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Tensor Bernstein concentration inequalities with an application to sample estimators for high-order moments
- Fast low rank approximations of matrices and tensors
- Column subset selection via sparse approximation of SVD
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.
- Low-rank decomposition meets kernel learning: a generalized Nyström method
- Generalized low rank approximations of matrices
- A way for low ranking matrices and its stochastic computations using Monte Carlo method
- Stochastic algorithms in linear algebra -- beyond the Markov chains and von Neumann-Ulam scheme
- Recovering PCA and sparse PCA via hybrid-\((\ell_1,\ell_2)\) sparse sampling of data elements
- Random perturbation of low rank matrices: improving classical bounds
- A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics
- Dense fast random projections and Lean Walsh transforms
- Why Are Big Data Matrices Approximately Low Rank?
- Fast monte-carlo algorithms for finding low-rank approximations
- Effective implementation to reduce execution time of a low-rank matrix approximation problem
- Approximating Matrix Multiplication for Pattern Recognition Tasks
This page was built for publication: Fast computation of low rank matrix approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176019)
