Subspace expanders and matrix rank minimization

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.

[1]  Ning Cai,et al.  Network Error Correction, II: Lower Bounds , 2006, Commun. Inf. Syst..

[2]  Cheng Jin,et al.  MATE: multipath adaptive traffic engineering , 2002, Comput. Networks.

[3]  Piotr Indyk,et al.  Sequential Sparse Matching Pursuit , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..

[5]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

[6]  Jörg Widmer,et al.  Network coding: an instant primer , 2006, CCRV.

[7]  J. Kuelbs Probability on Banach spaces , 1978 .

[8]  Mihailo Stojnic,et al.  Various thresholds for ℓ1-optimization in compressed sensing , 2009, ArXiv.

[9]  Pablo A. Parrilo,et al.  The Convex Geometry of Linear Inverse Problems , 2010, Foundations of Computational Mathematics.

[10]  Ao Tang,et al.  On the uniqueness of positive semidefinite matrix solution under compressed observations , 2010, 2010 IEEE International Symposium on Information Theory.

[11]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[12]  Emmanuel J. Candès,et al.  The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.

[13]  Babak Hassibi,et al.  Explicit measurements with almost optimal thresholds for compressed sensing , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[14]  Weiyu Xu,et al.  Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , 2007, 2007 IEEE Information Theory Workshop.

[15]  Alexandros G. Dimakis,et al.  Sparse Recovery of Nonnegative Signals With Minimal Expansion , 2011, IEEE Transactions on Signal Processing.

[16]  Tracey Ho,et al.  Resilient Network Coding in the Presence of Byzantine Adversaries , 2007, INFOCOM.

[17]  Osameh M. Al-Kofahi,et al.  Network protection codes: Providing self-healing in autonomic networks using network coding , 2008, Comput. Networks.

[18]  Piotr Indyk,et al.  Sparse Recovery Using Sparse Matrices , 2010, Proceedings of the IEEE.

[19]  Christos Gkantsidis,et al.  Cooperative Security for Network Coding File Distribution , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[20]  Richard J. La,et al.  Measurement-based optimal routing on overlay architectures for unicast sessions , 2006, Comput. Networks.

[21]  S. Szarek Metric Entropy of Homogeneous Spaces , 1997, math/9701213.

[22]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[23]  Vahid Tarokh,et al.  A Frame Construction and a Universal Distortion Bound for Sparse Representations , 2008, IEEE Transactions on Signal Processing.

[24]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[25]  M. Stojnic Various thresholds for $\ell_1$-optimization in compressed sensing , 2009 .

[26]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[27]  David Callan When Is “Rank” Additive? , 1998 .

[28]  Babak Hassibi,et al.  New Null Space Results and Recovery Thresholds for Matrix Rank Minimization , 2010, ArXiv.

[29]  Ahmed E. Kamal,et al.  Network Coding-Based Protection Strategy Against Node Failures , 2009, 2009 IEEE International Conference on Communications.

[30]  Weiyu Xu,et al.  Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization , 2008, 2008 47th IEEE Conference on Decision and Control.

[31]  Stanislaw J. Szarek Metric entropy of homogeneous spaces and Finsler geometry of classical Lie groups , 1997 .

[32]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[33]  Alexandros G. Dimakis,et al.  Sparse Recovery of Positive Signals with Minimal Expansion , 2009, ArXiv.