Fast monte-carlo algorithms for finding low-rank approximations
From MaRDI portal
(Redirected from Publication:5435673)
Recommendations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- A fast randomized algorithm for the approximation of matrices
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Fast low rank approximations of matrices and tensors
- Fast computation of low rank matrix approximations
Cited in
(only showing first 100 items - show all)- Towards theory of generic principal component analysis
- A randomized Kaczmarz algorithm with exponential convergence
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Fast dimension reduction using Rademacher series on dual BCH codes
- CUR matrix decompositions for improved data analysis
- Territorial design optimization for business sales plan
- Large-scale stochastic linear inversion using hierarchical matrices. Illustrated with an application to crosswell tomography in seismic imaging
- Finding metastabilities in reversible Markov chains based on incomplete sampling
- Randomized LU decomposition
- Forecasting using random subspace methods
- A Nyström spectral clustering algorithm based on probability incremental sampling
- Approximation error in regularized SVD-based Fourier continuations
- Web document clustering using hyperlink structures
- Second order accurate distributed eigenvector computation for extremely large matrices
- Randomized model order reduction
- A two-stage surrogate model for neo-Hookean problems based on adaptive proper orthogonal decomposition and hierarchical tensor approximation
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Geometric component analysis and its applications to data analysis
- Randomized block Krylov methods for approximating extreme eigenvalues
- A spectral method to find communities in bipartite networks
- Enhanced image approximation using shifted rank-1 reconstruction
- Regularized greedy column subset selection
- Sampling-based dimension reduction for subspace approximation with outliers
- Effective implementation to reduce execution time of a low-rank matrix approximation problem
- A cross-product approach for low-rank approximations of large matrices
- ALORA: affine low-rank approximations
- Randomized algorithms for low-rank matrix factorizations: sharp performance bounds
- Fast low-rank modifications of the thin singular value decomposition
- A fast block low-rank dense solver with applications to finite-element matrices
- Far-field compression for fast kernel summation methods in high dimensions
- Optimal subsampling for softmax regression
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- A way for low ranking matrices and its stochastic computations using Monte Carlo method
- Stochastic boundary methods of fundamental solutions for solving PDEs
- Column subset selection problem is UG-hard
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
- Low-rank approximations with sparse factors. I: Basic algorithms and error analysis
- Summarization and search over geometric spaces
- Frequent directions: simple and deterministic matrix sketching
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite-element matrices
- Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
- Matrix approximation and projective clustering via volume sampling
- Stochastic iterative projection methods for large linear systems
- Stochastic algorithms in linear algebra -- beyond the Markov chains and von Neumann-Ulam scheme
- Multiplicative Approximations of Random Walk Transition Probabilities
- On low rank matrix approximations with applications to synthesis problem in compressed sensing
- Randomized local model order reduction
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Approximating spectral clustering via sampling: a review
- A Computationally Efficient Projection-Based Approach for Spatial Generalized Linear Mixed Models
- Sampling from large matrices
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method
- On the low-rank approximation arising in the generalized Karhunen-Loeve transform
- SVD, discrepancy, and regular structure of contingency tables
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- A simple filter for detecting low-rank submatrices
- Detecting low-rank clusters via random sampling
- Dimensional reduction in vector space methods for natural language processing: products and projections
- scientific article; zbMATH DE number 1953870 (Why is no real title available?)
- Quantum machine learning: a classical perspective
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- Input sparsity time low-rank approximation via ridge leverage score sampling
- Randomized algorithms in numerical linear algebra
- Local reconstruction of low-rank matrices and subspaces
- Practical sketching algorithms for low-rank matrix approximation
- Literature survey on low rank approximation of matrices
- Robust PCA by manifold optimization
- Robust frequent directions with application in online learning
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- A Schur Method for Low-Rank Matrix Approximation
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Sublinear-time Algorithms
- Non-negative sparse regression and column subset selection with \(L_1\) error
- Low rank approximation of binary matrices: column subset selection and generalizations
- Sublinear-time quadratic minimization via spectral decomposition of matrices
- A nonlinear matrix decomposition for mining the zeros of sparse data
- scientific article; zbMATH DE number 7559394 (Why is no real title available?)
- scientific article; zbMATH DE number 7559424 (Why is no real title available?)
- SVM via saddle point optimization: new bounds and distributed algorithms
- Regularized Linear Inversion with Randomized Singular Value Decomposition
- Randomized methods for matrix computations
- Random sampling and efficient algorithms for multiscale PDEs
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions
- Subsampling algorithms for semidefinite programming
- A fast and efficient algorithm for low-rank approximation of a matrix
- Fast computation of low rank matrix approximations
- Randomized Dynamic Mode Decomposition
- Fast approximate truncated SVD.
- Streaming low-rank matrix approximation with an application to scientific simulation
- Fiber sampling approach to canonical polyadic decomposition and application to tensor completion
- Testing matrix rank, optimally
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Subspace Iteration Randomization and Singular Value Problems
- Estimating a few extreme singular values and vectors for large-scale matrices in tensor train format
- Fast randomized iteration: diffusion Monte Carlo through the Lens of numerical linear algebra
- Weighted low rank approximations with provable guarantees
- Low rank matrix-valued Chernoff bounds and approximate matrix multiplication
This page was built for publication: Fast monte-carlo algorithms for finding low-rank approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5435673)
