Relative-Error CUR Matrix Decompositions
From MaRDI portal
Relative-Error $CUR$ Matrix Decompositions
Recommendations
Cited in
(only showing first 100 items - show all)- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- CUR matrix decompositions for improved data analysis
- A Model-free Variable Screening Method Based on Leverage Score
- Fast quantum algorithms for least squares regression and statistic leverage scores
- Dense fast random projections and Lean Walsh transforms
- Efficient quaternion CUR method for low-rank approximation to quaternion matrix
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- A novel greedy block Gauss-Seidel method for solving large linear least-squares problems
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Matrix approximation and projective clustering via volume sampling
- Faster least squares approximation
- Proximal algorithms and temporal difference methods for solving fixed point problems
- Low-rank approximation of parameter-dependent matrices via CUR decomposition
- Randomized algorithms in numerical linear algebra
- Sampling from large matrices
- Random projections for the nonnegative least-squares problem
- Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
- A Distance-Preserving Matrix Sketch
- Analyzing the dissemination of news by model averaging and subsampling
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- An efficient algorithm for computing the approximate t-URV and its applications
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Optimal subsampling for softmax regression
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Generalizing the column-row matrix decomposition to multi-way arrays
- Large-Scale Low-Rank Gaussian Process Prediction with Support Points
- scientific article; zbMATH DE number 7307477 (Why is no real title available?)
- A semi-Lagrangian adaptive-rank (SLAR) method for linear advection and nonlinear Vlasov-Poisson system
- Regression-aware decompositions
- Hybrid CUR-type decomposition of tensors in the Tucker format
- Column subset selection problem is UG-hard
- Near-optimal discrete optimization for experimental design: a regret minimization approach
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Random sampling of bandlimited signals on graphs
- Admissible subspaces and the subspace iteration method
- Structure-aware analyses and algorithms for interpolative decompositions
- A bootstrap method for error estimation in randomized matrix multiplication
- Randomized numerical linear algebra: Foundations and algorithms
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- Towards more efficient SPSD matrix approximation and CUR matrix decomposition
- Randomized LU decomposition using sparse projections
- A DEIM induced CUR factorization
- Algorithm-agnostic low-rank approximation of operator monotone matrix functions
- Sketched ridge regression: optimization perspective, statistical perspective, and model averaging
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- A sublinear-time randomized algorithm for column and row subset selection based on strong rank-revealing QR factorizations
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
- A generalized CUR decomposition for matrix pairs
- Low rank approximation of binary matrices: column subset selection and generalizations
- Perturbations of CUR Decompositions
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- Summarization and search over geometric spaces
- Accuracy and stability of CUR decompositions with oversampling
- An L-DEIM induced high order tensor interpolatory decomposition
- Efficient quaternion CUR decomposition based on discrete empirical interpolation method
- Relaxed leverage sampling for low-rank matrix completion
- Algorithms for approximate subtropical matrix factorization
- An O(N N) hierarchical random compression method for kernel matrices by sampling partial matrix entries
- System identification via CUR-factored Hankel approximation
- Perspectives on CUR decompositions
- On the optimality of Voronoi-based column selection
- Spectral estimation from simulations via sketching
- Block discrete empirical interpolation methods
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Efficient algorithms for CUR and interpolative matrix decompositions
- Conditioning of leverage scores and computation by QR decomposition
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition
- Robust CUR Decomposition: Theory and Imaging Applications
- 6 The Loewner framework for system identification and reduction
- An efficient, memory-saving approach for the Loewner framework
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Dominant subspace and low-rank approximations from block Krylov subspaces without a prescribed gap
- Frequent directions: simple and deterministic matrix sketching
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- CUR LRA at Sublinear Cost Based on Volume Maximization
- Robust frequent directions with application in online learning
- Subspace Iteration Randomization and Singular Value Problems
- Randomized GCUR decompositions
- Link Prediction for Egocentrically Sampled Networks
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Fast algorithms for least squares problems with Kronecker lower subsets
- Pseudo-skeleton approximations with better accuracy estimates
- Randomized approach to matrix completion: applications in recommendation systems and image inpainting
- Leverage score-based quaternion CUR decomposition: gap error analysis and applications
- CPQR-based randomized algorithms for generalized CUR decompositions
- Geometric component analysis and its applications to data analysis
- Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions
- Maximal volume matrix cross approximation for image compression and least squares solution
- Randomized generalized singular value decomposition
- Optimal approximation of a large matrix by a sum of projected linear mappings on prescribed subspaces
- Column subset selection via sparse approximation of SVD
- Tensor CUR decomposition under T-product and its perturbation
- An extended DEIM algorithm for subset selection and class identification
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.
- A hybrid stochastic interpolation and compression method for kernel matrices
- On computationally tractable selection of experiments in measurement-constrained regression models
- Solving sparse linear systems faster than matrix multiplication
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)
