Relative-Error $CUR$ Matrix Decompositions
From MaRDI portal
Publication:3624872
DOI10.1137/07070471XzbMath1183.68738OpenAlexW1998269045MaRDI 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
Related Items (81)
Efficient algorithms for CUR and interpolative matrix decompositions ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ Spectral estimation from simulations via sketching ⋮ Relaxed leverage sampling for low-rank matrix completion ⋮ Randomized Local Model Order Reduction ⋮ Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores ⋮ A Distance-Preserving Matrix Sketch ⋮ An efficient, memory-saving approach for the Loewner framework ⋮ Column subset selection problem is UG-hard ⋮ A Generalized CUR Decomposition for Matrix Pairs ⋮ 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 ⋮ Tensor CUR Decomposition under T-Product and Its Perturbation ⋮ Pseudo-skeleton approximations with better accuracy estimates ⋮ Randomized generalized singular value decomposition ⋮ 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 algorithms in numerical linear algebra ⋮ Randomized LU decomposition ⋮ Random sampling of bandlimited signals on graphs ⋮ Randomized Quasi-Optimal Local Approximation Spaces in Time ⋮ Faster least squares approximation ⋮ Optimal subsampling for softmax regression ⋮ Adaptive sparse interpolation for accelerating nonlinear stochastic reduced-order modeling with time-dependent bases ⋮ Admissible subspaces and the subspace iteration method ⋮ Exemplar-based large-scale low-rank matrix decomposition for collaborative prediction ⋮ Dense fast random projections and Lean Walsh transforms ⋮ Link Prediction for Egocentrically Sampled Networks ⋮ Generalized pseudoskeleton decompositions ⋮ Unnamed Item ⋮ Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. ⋮ Literature survey on low rank approximation of matrices ⋮ Optimal CUR Matrix Decompositions ⋮ Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma ⋮ System Identification via CUR-Factored Hankel Approximation ⋮ Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition ⋮ Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces ⋮ A Model-free Variable Screening Method Based on Leverage Score ⋮ 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 ⋮ Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection ⋮ Regression-aware decompositions ⋮ Fast quantum algorithms for least squares regression and statistic leverage scores ⋮ Randomized LU decomposition using sparse projections ⋮ Generalizing the column-row matrix decomposition to multi-way arrays ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fast randomized matrix and tensor interpolative decomposition using countsketch ⋮ Proximal algorithms and temporal difference methods for solving fixed point problems ⋮ Geometric component analysis and its applications to data analysis ⋮ CUR matrix decompositions for improved data analysis ⋮ Summarization and Search Over Geometric Spaces ⋮ A DEIM Induced CUR Factorization ⋮ The Fast Cauchy Transform and Faster Robust Linear Regression ⋮ Perspectives on CUR decompositions ⋮ An extended DEIM algorithm for subset selection and class identification ⋮ 6 The Loewner framework for system identification and reduction ⋮ HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation ⋮ Frequent Directions: Simple and Deterministic Matrix Sketching ⋮ On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices ⋮ Column subset selection via sparse approximation of SVD ⋮ Random projections for the nonnegative least-squares problem ⋮ Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data ⋮ On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models ⋮ High-dimensional model recovery from random sketched data by exploring intrinsic sparsity ⋮ Unnamed Item ⋮ Conditioning of Leverage Scores and Computation by QR Decomposition ⋮ Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds ⋮ Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning ⋮ Subspace Iteration Randomization and Singular Value Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Perturbations of CUR Decompositions ⋮ Robust CUR Decomposition: Theory and Imaging Applications ⋮ CUR LRA at Sublinear Cost Based on Volume Maximization ⋮ Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition ⋮ Hybrid CUR-type decomposition of tensors in the Tucker format
Uses Software
This page was built for publication: Relative-Error $CUR$ Matrix Decompositions
