Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
From MaRDI portal
Publication:5470750
DOI10.1137/S0097539704442696zbMath1111.68148MaRDI QIDQ5470750
Michael W. Mahoney, Petros Drineas, Ravindran Kannan
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items
\(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems, Randomized numerical linear algebra: Foundations and algorithms, WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions, Minimum \( n\)-rank approximation via iterative hard thresholding, Functional principal subspace sampling for large scale functional data analysis, Randomized Local Model Order Reduction, Column subset selection problem is UG-hard, Unnamed Item, Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization, HNCcorr: combinatorial optimization for neuron identification, A randomized algorithm for a tensor-based generalization of the singular value decomposition, Far-field compression for fast kernel summation methods in high dimensions, An approximate empirical Bayesian method for large-scale linear-Gaussian inverse problems, On the low-rank approximation arising in the generalized Karhunen-Loeve transform, Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation, Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices, Exact minimum rank approximation via Schatten \(p\)-norm minimization, Nyström-based approximate kernel subspace learning, Fast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra, A compact heart iteration for low-rank approximations of large matrices, Robust enhanced indexation optimization with sparse industry Layout constraint, A literature survey of matrix methods for data science, Pass-efficient randomized LU algorithms for computing low-rank matrix approximation, Uncovering block structures in large rectangular matrices, A hybrid stochastic interpolation and compression method for kernel matrices, Randomized algorithms in numerical linear algebra, Randomized LU decomposition, Optimal subsampling for softmax regression, Fast deflation sparse principal component analysis via subspace projections, Unnamed Item, CUR and Generalized CUR Decompositions of Quaternion Matrices and their Applications, A parallel low rank matrix optimization method for recovering Internet traffic network data via link flow measurement, Solution of the EEG inverse problem by random dipole sampling, Admissible subspaces and the subspace iteration method, A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems, Exemplar-based large-scale low-rank matrix decomposition for collaborative prediction, Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory, Literature survey on low rank approximation of matrices, Optimal CUR Matrix Decompositions, Anomaly detection in large-scale data stream networks, Second order accurate distributed eigenvector computation for extremely large matrices, Exemplar-based low-rank matrix decomposition for data clustering, Fast Estimation of Approximate Matrix Ranks Using Spectral Densities, An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion, An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries, Random batch methods (RBM) for interacting particle systems, Randomized algorithms for the low multilinear rank approximations of tensors, Approximating Spectral Clustering via Sampling: A Review, Effective implementation to reduce execution time of a low-rank matrix approximation problem, The Fourier approximation of smooth but non-periodic functions from unevenly spaced data, An improvement of the parameterized frequent directions algorithm, Matrix recipes for hard thresholding methods, Approximation error in regularized SVD-based Fourier continuations, Convergence of fixed-point continuation algorithms for matrix rank minimization, Householder QR Factorization With Randomization for Column Pivoting (HQRRP), Fixed point and Bregman iterative methods for matrix rank minimization, Fast construction of hierarchical matrix representation from matrix-vector multiplication, Block classical Gram–Schmidt-based block updating in low-rank matrix approximation, Randomized LU decomposition using sparse projections, Unnamed Item, Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification, Hierarchical Approximate Proper Orthogonal Decomposition, Proximal algorithms and temporal difference methods for solving fixed point problems, A way for low ranking matrices and its stochastic computations using Monte Carlo method, Low rank approximation of the symmetric positive semidefinite matrix, An iterative algorithm for third-order tensor multi-rank minimization, Optimal regularized low rank inverse approximation, A randomized balanced proper orthogonal decomposition technique, Localized bases of eigensubspaces and operator compression, A cross-product approach for low-rank approximations of large matrices, A note on linear function approximation using random projections, An efficient randomized algorithm for computing the approximate Tucker decomposition, Less is More: Sparse Graph Mining with Compact Matrix Decomposition, Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition, GraphLSHC: towards large scale spectral hypergraph clustering, Frequent Directions: Simple and Deterministic Matrix Sketching, Unnamed Item, POD-DL-ROM: enhancing deep learning-based reduced order models for nonlinear parametrized PDEs by proper orthogonal decomposition, Unfoldings and the rank-one approximation of the tensor, Column subset selection via sparse approximation of SVD, Randomized block Krylov methods for approximating extreme eigenvalues, Clustered Matrix Approximation, On selecting a maximum volume sub-matrix of a matrix and related problems, Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization, Subsampling Algorithms for Semidefinite Programming, Fast dimension reduction using Rademacher series on dual BCH codes, Multiway Monte Carlo Method for Linear Systems, Low-Rank Matrix Approximations Do Not Need a Singular Value Gap, Subspace Iteration Randomization and Singular Value Problems, Unnamed Item, Unnamed Item, Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition, Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion, Unconfused ultraconservative multiclass algorithms, Optimal Regularized Inverse Matrices for Inverse Problems
