Relative-Error $CUR$ Matrix Decompositions
From MaRDI portal
Publication:3624872
DOI10.1137/07070471XzbMath1183.68738MaRDI QIDQ3624872
No author found.
Publication date: 30 April 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/07070471x
68W20: Randomized algorithms
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Randomized algorithms in numerical linear algebra, Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1., Literature survey on low rank approximation of matrices, System Identification via CUR-Factored Hankel Approximation, On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models, Unnamed Item, Unnamed Item, Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning, Unnamed Item, CUR LRA at Sublinear Cost Based on Volume Maximization, A Distance-Preserving Matrix Sketch, A Generalized CUR Decomposition for Matrix Pairs, Tensor CUR Decomposition under T-Product and Its Perturbation, Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection, Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data, Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds, Subspace Iteration Randomization and Singular Value Problems, Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces, Conditioning of Leverage Scores and Computation by QR Decomposition, Perturbations of CUR Decompositions, Robust CUR Decomposition: Theory and Imaging Applications, Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition, Randomized numerical linear algebra: Foundations and algorithms, A Model-free Variable Screening Method Based on Leverage Score, One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering, Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions, A hybrid stochastic interpolation and compression method for kernel matrices, Randomized Quasi-Optimal Local Approximation Spaces in Time, Exemplar-based large-scale low-rank matrix decomposition for collaborative prediction, CUR matrix decompositions for improved data analysis, Fast quantum algorithms for least squares regression and statistic leverage scores, Faster least squares approximation, Dense fast random projections and Lean Walsh transforms, Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma, Proximal algorithms and temporal difference methods for solving fixed point problems, Column subset selection via sparse approximation of SVD, High-dimensional model recovery from random sketched data by exploring intrinsic sparsity, Generalizing the column-row matrix decomposition to multi-way arrays, Random projections for the nonnegative least-squares problem, Pseudo-skeleton approximations with better accuracy estimates, Randomized LU decomposition, Random sampling of bandlimited signals on graphs, Regression-aware decompositions, Randomized LU decomposition using sparse projections, Fast randomized matrix and tensor interpolative decomposition using countsketch, Geometric component analysis and its applications to data analysis, An extended DEIM algorithm for subset selection and class identification, Hybrid CUR-type decomposition of tensors in the Tucker format, Spectral estimation from simulations via sketching, An efficient, memory-saving approach for the Loewner framework, Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format, An efficient algorithm for computing the approximate t-URV and its applications, An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries, Near-optimal discrete optimization for experimental design: a regret minimization approach, Perspectives on CUR decompositions, On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices, Efficient algorithms for CUR and interpolative matrix decompositions, Optimal subsampling for softmax regression, Relaxed leverage sampling for low-rank matrix completion, Column subset selection problem is UG-hard, Randomized generalized singular value decomposition, Adaptive sparse interpolation for accelerating nonlinear stochastic reduced-order modeling with time-dependent bases, Generalized pseudoskeleton decompositions, Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition, Summarization and Search Over Geometric Spaces, A DEIM Induced CUR Factorization, The Fast Cauchy Transform and Faster Robust Linear Regression, HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation, Frequent Directions: Simple and Deterministic Matrix Sketching, Optimal CUR Matrix Decompositions, Randomized Local Model Order Reduction, 6 The Loewner framework for system identification and reduction, Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores
Uses Software
