Perspectives on CUR decompositions
From MaRDI portal
Publication:2300772
Abstract: This note discusses an interesting matrix factorization called the CUR Decomposition. We illustrate various viewpoints of this method by comparing and contrasting them in different situations. Additionally, we offer a new characterization of CUR decompositions which synergizes these viewpoints and shows that they are indeed the same in the exact decomposition case.
Recommendations
Cites work
- A DEIM induced CUR factorization
- A theory of pseudoskeleton approximations
- A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length
- An improved approximation algorithm for the column subset selection problem
- Column subset selection problem is UG-hard
- Column subset selection, matrix factorization, and eigenvalue optimization
- CUR matrix decompositions for improved data analysis
- Efficient algorithms for CUR and interpolative matrix decompositions
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Generalizing the column-row matrix decomposition to multi-way arrays
- scientific article; zbMATH DE number 3116987 (Why is no real title available?)
- scientific article; zbMATH DE number 1888461 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- On the power of unique 2-prover 1-round games
- Pseudo-skeleton approximations by matrices of maximal volume
- Pseudoskeleton approximations of matrices
- Relative-Error CUR Matrix Decompositions
- Similarity matrix framework for data from union of subspaces
- Sublinear randomized algorithms for skeleton decompositions
Cited in
(19)- CUR matrix decompositions for improved data analysis
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Generalized pseudoskeleton decompositions
- \textit{Lu} and \textit{CR} elimination
- Three matrix factorizations from the steps of elimination
- Tensor CUR decomposition under T-product and its perturbation
- Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions
- Perturbations of CUR Decompositions
- Robust CUR Decomposition: Theory and Imaging Applications
- CUR and Generalized CUR Decompositions of Quaternion Matrices and their Applications
- Robust tensor CUR decompositions: rapid low-Tucker-rank tensor recovery with sparse corruptions
- Korean topic modeling using matrix decomposition
- Coseparable nonnegative tensor factorization with t-CUR decomposition
- Maximal volume matrix cross approximation for image compression and least squares solution
- Randomized approach to matrix completion: applications in recommendation systems and image inpainting
- Functions on symmetric matrices and point clouds via lightweight invariant features from Galois theory
- Low-rank approximation of parameter-dependent matrices via CUR decomposition
- Accuracy and stability of CUR decompositions with oversampling
- Efficient quaternion CUR decomposition based on discrete empirical interpolation method
This page was built for publication: Perspectives on CUR decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300772)
