Perturbations of CUR Decompositions
From MaRDI portal
Publication:5857848
DOI10.1137/19M128394XOpenAlexW3134139903MaRDI QIDQ5857848
Publication date: 8 April 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.08101
Factorization of matrices (15A23) Theory of data (68P99) Randomized algorithms (68W20) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (max. 100)
Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format ⋮ Tensor CUR Decomposition under T-Product and Its Perturbation ⋮ A literature survey of matrix methods for data science ⋮ Lower bounds for column matrix approximations ⋮ Unnamed Item ⋮ Robust CUR Decomposition: Theory and Imaging Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- CUR matrix decompositions for improved data analysis
- Similarity matrix framework for data from union of subspaces
- Pseudo-skeleton approximations by matrices of maximal volume
- A theory of pseudoskeleton approximations
- Kronecker-product approximations for some function-related matrices.
- Pseudo-skeleton approximations with better accuracy estimates
- Rectangular maximum-volume submatrices and their applications
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Perspectives on CUR decompositions
- Efficient algorithms for CUR and interpolative matrix decompositions
- Exact matrix completion via convex optimization
- A DEIM Induced CUR Factorization
- Sublinear Randomized Algorithms for Skeleton Decompositions
- Decay Bounds for Functions of Hermitian Matrices with Banded or Kronecker Structure
- Optimal CUR Matrix Decompositions
- Robust principal component analysis?
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Low-Rank Matrix Approximations Do Not Need a Singular Value Gap
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- Tricks or Treats with the Hilbert Matrix
- Relative-Error $CUR$ Matrix Decompositions
- On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Why Are Big Data Matrices Approximately Low Rank?
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
- Sparsity and incoherence in compressive sampling
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
This page was built for publication: Perturbations of CUR Decompositions
