Relative-Error CUR Matrix Decompositions
From MaRDI portal
Relative-Error $CUR$ Matrix Decompositions
Recommendations
Cited in
(only showing first 100 items - show all)- Random projections for the nonnegative least-squares problem
- CUR matrix decompositions for improved data analysis
- 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
- Algorithms for approximate subtropical matrix factorization
- An O(N 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
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- Frequent directions: simple and deterministic matrix sketching
- Clustered matrix approximation
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- Towards more efficient SPSD matrix approximation and CUR matrix decomposition
- Matrix approximation and projective clustering via volume sampling
- 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
- Sampling from large matrices
- Reverse iterative volume sampling for linear regression
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- Sketched ridge regression: optimization perspective, statistical perspective, and model averaging
- 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
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- A bootstrap method for error estimation in randomized matrix multiplication
- Robust frequent directions with application in online learning
- On computationally tractable selection of experiments in measurement-constrained regression models
- Low rank approximation of binary matrices: column subset selection and generalizations
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- CUR LRA at Sublinear Cost Based on Volume Maximization
- A Distance-Preserving Matrix Sketch
- A generalized CUR decomposition for matrix pairs
- Fast quantum algorithms for least squares regression and statistic leverage scores
- Tensor CUR decomposition under T-product and its perturbation
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- scientific article; zbMATH DE number 7307477 (Why is no real title available?)
- Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions
- 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
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- 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
- 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
- A Model-free Variable Screening Method Based on Leverage Score
- Admissible subspaces and the subspace iteration method
- Exemplar-based large-scale low-rank matrix decomposition for collaborative prediction
- Link Prediction for Egocentrically Sampled Networks
- Faster least squares approximation
- Dense fast random projections and Lean Walsh transforms
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- CPQR-based randomized algorithms for generalized CUR decompositions
- New subset selection algorithms for low rank approximation: offline and online
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- An L-DEIM induced high order tensor interpolatory decomposition
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- Block discrete empirical interpolation methods
- Randomized GCUR decompositions
- Maximal volume matrix cross approximation for image compression and least squares solution
- Optimal approximation of a large matrix by a sum of projected linear mappings on prescribed subspaces
- Efficient bounds and estimates for canonical angles in randomized subspace approximations
- The discrete empirical interpolation method in class identification and data summarization
- Fast algorithms for least squares problems with Kronecker lower subsets
- Randomized approach to matrix completion: applications in recommendation systems and image inpainting
- Solving sparse linear systems faster than matrix multiplication
- Online sequential leveraging sampling method for streaming autoregressive time series with application to seismic data
- A statistical view of column subset selection
- MUSO: achieving exact machine unlearning in over-parameterized regimes
This page was built for publication: Relative-Error $CUR$ Matrix Decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624872)
