Compressed Sensing and Matrix Completion with Constant Proportion of
Corruptions

v1v2 (latest)

Compressed Sensing and Matrix Completion with Constant Proportion of Corruptions

6 April 2011

ArXiv (abs)PDF HTML

Papers citing "Compressed Sensing and Matrix Completion with Constant Proportion of Corruptions"

9 / 9 papers shown

Title
Robust Lasso with missing and grossly corrupted observations Nam H. Nguyen T. Tran 131 156 0 02 Dec 2011
Low-rank Matrix Recovery from Errors and Erasures Yudong Chen A. Jalali Sujay Sanghavi Constantine Caramanis 117 166 0 03 Apr 2011
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions Alekh Agarwal S. Negahban Martin J. Wainwright 234 433 0 23 Feb 2011
Exact recoverability from dense corrupted observations via $L_1$ minimization Nam H. Nguyen T. Tran 102 117 0 07 Feb 2011
Robust PCA via Outlier Pursuit Huan Xu Constantine Caramanis Sujay Sanghavi 116 768 0 20 Oct 2010
Rank-Sparsity Incoherence for Matrix Decomposition V. Chandrasekaran Sujay Sanghavi P. Parrilo A. Willsky CML 260 1,111 0 11 Jun 2009
Matrix Completion from a Few Entries Raghunandan H. Keshavan Andrea Montanari Sewoong Oh 444 1,247 0 20 Jan 2009
$Near-ideal model selection by $\ell_1$ minimization$ Near-ideal model selection by $\ell_1$ minimization Emmanuel J. Candès Y. Plan 327 225 0 02 Jan 2008
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization Benjamin Recht Maryam Fazel P. Parrilo 424 3,773 0 28 Jun 2007

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.