Algorithms and Hardness for Robust Subspace Recovery

v1v2v3 (latest)

Algorithms and Hardness for Robust Subspace Recovery

5 November 2012

ArXiv (abs)PDF HTML

Papers citing "Algorithms and Hardness for Robust Subspace Recovery"

9 / 59 papers shown

Title
Completing Low-Rank Matrices with Corrupted Samples from Few Coefficients in General Basis Hongyang R. Zhang Zhouchen Lin Chao Zhang 71 20 0 25 Jun 2015
Randomized Robust Subspace Recovery for High Dimensional Data Matrices M. Rahmani George Atia 89 57 0 21 May 2015
Relations among Some Low Rank Subspace Recovery Models Hongyang R. Zhang Zhouchen Lin Chao Zhang Junbin Gao 85 29 0 06 Dec 2014
Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling Xingguo Li Jarvis Haupt 115 59 0 01 Jul 2014
Fast, Robust and Non-convex Subspace Recovery Gilad Lerman Tyler Maunu 119 78 0 24 Jun 2014
Computational Limits for Matrix Completion Moritz Hardt Raghu Meka P. Raghavendra Benjamin Weitz 82 59 0 10 Feb 2014
Marchenko-Pastur Law for Tyler's M-estimator Teng Zhang Xiuyuan Cheng A. Singer 135 24 0 15 Jan 2014
Robust subspace recovery by Tyler's M-estimator Teng Zhang 144 28 0 07 Jun 2012
A Novel M-Estimator for Robust PCA Teng Zhang Gilad Lerman 127 133 0 20 Dec 2011