Perturbations of CUR Decompositions
Keaton Hamm, Longxiu Huang

TL;DR
This paper analyzes how noise impacts CUR matrix decompositions, providing perturbation estimates for various variants and demonstrating how column and row choices influence approximation quality.
Contribution
It offers a comprehensive perturbation analysis of CUR decompositions under noise, including new bounds and insights into the effects of column and row selection.
Findings
Perturbation estimates depend on noise magnitude and matrix norms.
Choice of columns and rows significantly affects approximation quality.
New state-of-the-art bounds for certain CUR variants.
Abstract
The CUR decomposition is a factorization of a low-rank matrix obtained by selecting certain column and row submatrices of it. We perform a thorough investigation of what happens to such decompositions in the presence of noise. Since CUR decompositions are non-uniquely formed, we investigate several variants and give perturbation estimates for each in terms of the magnitude of the noise matrix in a broad class of norms which includes all Schatten --norms. The estimates given here are qualitative and illustrate how the choice of columns and rows affects the quality of the approximation, and additionally we obtain new state-of-the-art bounds for some variants of CUR approximations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Tensor decomposition and applications · Blind Source Separation Techniques
