Perspectives on CUR decompositions

DOI10.1016/J.ACHA.2019.08.006zbMath1432.15014arXiv1907.12668OpenAlexW2971963065MaRDI QIDQ2300772

Longxiu Huang, Keaton Hamm

Publication date: 28 February 2020

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.12668

zbMATH Keywords

low rank matrix approximationCUR decompositioncolumn subset selection

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (12)

Three matrix factorizations from the steps of elimination ⋮ Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format ⋮ Tensor CUR Decomposition under T-Product and Its Perturbation ⋮ CUR and Generalized CUR Decompositions of Quaternion Matrices and their Applications ⋮ Generalized pseudoskeleton decompositions ⋮ Robust tensor CUR decompositions: rapid low-Tucker-rank tensor recovery with sparse corruptions ⋮ Coseparable nonnegative tensor factorization with t-CUR decomposition ⋮ Maximal volume matrix cross approximation for image compression and least squares solution ⋮ Unnamed Item ⋮ Perturbations of CUR Decompositions ⋮ Robust CUR Decomposition: Theory and Imaging Applications ⋮ LU and CR Elimination

Cites Work

• 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
• A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length
• Similarity matrix framework for data from union of subspaces
• Generalizing the column-row matrix decomposition to multi-way arrays
• Pseudo-skeleton approximations by matrices of maximal volume
• A theory of pseudoskeleton approximations
• Pseudoskeleton approximations of matrices
• Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
• Efficient algorithms for CUR and interpolative matrix decompositions
• Column subset selection problem is UG-hard
• A DEIM Induced CUR Factorization
• Sublinear Randomized Algorithms for Skeleton Decompositions
• On the power of unique 2-prover 1-round games
• Relative-Error $CUR$ Matrix Decompositions
• Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
• Inequalities: theory of majorization and its applications

This page was built for publication: Perspectives on CUR decompositions