Perturbations of CUR Decompositions

08/21/2019
by   Keaton Hamm, et al.
0

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 p--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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/22/2019

CUR Decompositions, Approximations, and Perturbations

This article discusses a useful tool in dimensionality reduction and low...
research
01/08/2020

Stability of Sampling for CUR Decompositions

This article studies how to form CUR decompositions of low-rank matrices...
research
07/29/2019

Perspectives on CUR Decompositions

This note discusses an interesting matrix factorization called the CUR D...
research
01/08/2016

Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition

The row (resp. column) rank profile of a matrix describes the stair-case...
research
04/13/2021

Simpler is better: A comparative study of randomized algorithms for computing the CUR decomposition

The CUR decomposition is a technique for low-rank approximation that sel...
research
09/01/2020

Multilevel decompositions and norms for negative order Sobolev spaces

We consider multilevel decompositions of piecewise constants on simplici...

Please sign up or login with your details

Forgot password? Click here to reset