Fetching the paper…
Reading the bibliography…
We consider the problem of Robust PCA in the fully and partially observed settings.
“Fast Monte-Carlo algorithms for finding low-rank approximations”
Alan Frieze, Ravi Kannan and Santosh Vempala · 2004
Earlier work this paper cites.
“Phase retrieval via Wirtinger flow: Theory and algorithms”
Emmanuel˜J. Cand\‘es, Xiaodong Li and Mahdi Soltanolkotabi · 2007
Earlier work this paper cites.
“Exact matrix completion via convex optimization”
Emmanuel˜J. Cand\‘es and Benjamin Recht · 2009
Earlier work this paper cites.
“Robust principal component analysis?”
Emmanuel˜J. Cand\‘es, Xiaodong Li, Yi Ma and John Wright · 2011
Earlier work this paper cites.
“Rank-sparsity incoherence for matrix decomposition”
Venkat Chandrasekaran, Sujay Sanghavi, Pablo˜A. Parrilo and Alan˜S. Willsky · 2011
Earlier work this paper cites.
“Robust matrix decomposition with sparse corruptions”
Daniel Hsu, Sham˜M. Kakade and Tong Zhang · 2011
Earlier work this paper cites.
“Numerical Methods for Large Eigenvalue Problems: Revised Edition”
Yousef Saad · 2011
Earlier work this paper cites.
“Robust PCA via Outlier Pursuit”
Huan Xu, Constantine Caramanis and Sujay Sanghavi · 2012
Earlier work this paper cites.
“Low-rank Matrix Recovery from Errors and Erasures”
Yudong Chen, Ali Jalali, Sujay Sanghavi and Constantine Caramanis · 2013
Earlier work this paper cites.
“Low rank approximation and regression in input sparsity time”
Kenneth˜L. Clarkson and David˜P. Woodruff · 2013
Earlier work this paper cites.
“Low-rank matrix completion using alternating minimization”
Prateek Jain, Praneeth Netrapalli and Sujay Sanghavi · 2013
Earlier work this paper cites.
“The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices”
Zhouchen Lin, Minming Chen and Yi Ma · 2013
Cited alongside, same era.
“Tensor decompositions for learning latent variable models”
Animashree Anandkumar, Rong Ge, Daniel Hsu, Sham˜M. Kakade and Matus Telgarsky · 2014
Cited alongside, same era.
“Statistical guarantees for the EM algorithm: From population to sample-based analysis”
Sivaraman Balakrishnan, Martin˜J. Wainwright and Bin Yu · 2014
Cited alongside, same era.
“Understanding alternating minimization for matrix completion”
Moritz Hardt · 2014
Cited alongside, same era.
“Non-convex robust PCA”
Praneeth Netrapalli, UN Niranjan, Sujay Sanghavi, Animashree Anandkumar and Prateek Jain · 2014
Cited alongside, same era.
“Guaranteed matrix completion via nonconvex factorization”
Ruoyu Sun and Zhi-Quan Luo · 2015
Later among the works it cites.
“Low-rank solutions of linear matrix equations via procrustes flow”
Stephen Tu, Ross Boczar, Mahdi Soltanolkotabi and Benjamin Recht · 2015
Later among the works it cites.
“High Dimensional EM Algorithm: Statistical Optimization and Asymptotic Normality”
Zhaoran Wang, Quanquan Gu, Yang Ning and Han Liu · 2015
Later among the works it cites.
“Regularized EM Algorithms: A Unified Framework and Statistical Guarantees”
Xinyang Yi and Constantine Caramanis · 2015
Later among the works it cites.
“A Nonconvex Optimization Framework for Low Rank Matrix Estimation”
Tuo Zhao, Zhaoran Wang and Han Liu · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Tighter low-rank approximation via sampling the leveraged element”
Srinadh Bhojanapalli, Prateek Jain and Sujay Sanghavi · 2015
Cited alongside, same era.
“Dropping convexity for faster semi-definite optimization”
Srinadh Bhojanapalli, Anastasios Kyrillidis and Sujay Sanghavi · 2015
Cited alongside, same era.
“Incoherence-Optimal Matrix Completion”
Yudong Chen · 2015
Cited alongside, same era.
Yudong Chen and Martin˜J. Wainwright · 2015
Cited alongside, same era.
“Solving random quadratic systems of equations is nearly as easy as solving linear systems”
Yuxin Chen and Emmanuel˜J. Cand\‘es · 2015
Cited alongside, same era.
“When Are Nonconvex Problems Not Scary?”
Ju Sun, Qing Qu and John Wright · 2015
Cited alongside, same era.
Qinqing Zheng and John Lafferty · 2015
Later among the works it cites.
“Nearly-optimal Robust Matrix Completion”
Yeshwanth Cherapanamjeri, Kartik Gupta and Prateek Jain · 2016
Closest in time.
“Low-Rank and Sparse Structure Pursuit via Alternating Minimization”
Quanquan Gu, Zhaoran Wang and Han Liu · 2016
Closest in time.
“Provable Non-convex Phase Retrieval with Outliers: Median Truncated Wirtinger Flow”
Huishuai Zhang, Yuejie Chi and Yingbin Liang · 2016
Closest in time.
“The power of convex relaxation: Near-optimal matrix completion”
Emmanuel˜J. Cand\‘es and Terence Tao · 2080
Closest in time.