Back to Search Start Over

Subspace Expanders and Matrix Rank Minimization

Authors :
Oymak, Samet
Khajehnejad, Amin
Hassibi, Babak
Oymak, Samet
Khajehnejad, Amin
Hassibi, Babak
Publication Year :
2011

Abstract

Matrix rank minimization (RM) problems recently gained extensive attention due to numerous applications in machine learning, system identification and graphical models. In RM problem, one aims to find the matrix with the lowest rank that satisfies a set of linear constraints. The existing algorithms include nuclear norm minimization (NNM) and singular value thresholding. Thus far, most of the attention has been on i.i.d. Gaussian or Bernoulli measurement operators. In this work, we introduce a new class of measurement operators, and a novel recovery algorithm, which is notably faster than NNM. The proposed operators are based on what we refer to as subspace expanders, which are inspired by the well known expander graphs based measurement matrices in compressed sensing. We show that given an n×n PSD matrix of rank r, it can be uniquely recovered from a minimal sampling of O(nr) measurements using the proposed structures, and the recovery algorithm can be cast as matrix inversion after a few initial processing steps.

Details

Database :
OAIster
Notes :
application/pdf, Subspace Expanders and Matrix Rank Minimization, English
Publication Type :
Electronic Resource
Accession number :
edsoai.on1005054260
Document Type :
Electronic Resource