Completing Low-Rank Matrices with Corrupted Samples from Few Coefficients in General Basis

by   Hongyang Zhang, et al.

Subspace recovery from corrupted and missing data is crucial for various applications in signal processing and information theory. To complete missing values and detect column corruptions, existing robust Matrix Completion (MC) methods mostly concentrate on recovering a low-rank matrix from few corrupted coefficients w.r.t. standard basis, which, however, does not apply to more general basis, e.g., Fourier basis. In this paper, we prove that the range space of an m× n matrix with rank r can be exactly recovered from few coefficients w.r.t. general basis, though r and the number of corrupted samples are both as high as O({m,n}/^3 (m+n)). Our model covers previous ones as special cases, and robust MC can recover the intrinsic matrix with a higher rank. Moreover, we suggest a universal choice of the regularization parameter, which is λ=1/√( n). By our ℓ_2,1 filtering algorithm, which has theoretical guarantees, we can further reduce the computational cost of our model. As an application, we also find that the solutions to extended robust Low-Rank Representation and to our extended robust MC are mutually expressible, so both our theory and algorithm can be applied to the subspace clustering problem with missing values under certain conditions. Experiments verify our theories.


Clipped Matrix Completion: a Remedy for Ceiling Effects

We consider the recovery of a low-rank matrix from its clipped observati...

Low-rank Matrix Completion in a General Non-orthogonal Basis

This paper considers theoretical analysis of recovering a low rank matri...

Sparse spectral estimation with missing and corrupted measurements

Supervised learning methods with missing data have been extensively stud...

Matrix Co-completion for Multi-label Classification with Missing Features and Labels

We consider a challenging multi-label classification problem where both ...

AIR-Net: Adaptive and Implicit Regularization Neural Network for Matrix Completion

Conventionally, the matrix completion (MC) model aims to recover a matri...

Memory of recurrent networks: Do we compute it right?

Numerical evaluations of the memory capacity (MC) of recurrent neural ne...

Polynomial Matrix Completion for Missing Data Imputation and Transductive Learning

This paper develops new methods to recover the missing entries of a high...

Please sign up or login with your details

Forgot password? Click here to reset