Fetching the paper…
Reading the bibliography…
This paper considers the matrix completion problem.
Perturbation Bounds for Matrix Eigenvalues
Rajendra Bhatia · 1987
Earlier work this paper cites.
Finding a large hidden clique in a random graph
Noga Alon, Michael Krivelevich, and Benny Sudakov · 1998
Earlier work this paper cites.
Hiding cliques for cryptographic security
Ari Juels and Marcus Peinado · 2000
Earlier work this paper cites.
Spectral partitioning of random graphs
Frank McSherry · 2001
Earlier work this paper cites.
Elements of information theory
Thomas M. Cover and Joy A. Thomas · 2006
Earlier work this paper cites.
Testing k-wise and almost k-wise independence
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, and Ning Xie · 2007
Earlier work this paper cites.
Exact matrix completion via convex optimization
Emmanuel J. Candes and Benjamin Recht · 2009
Earlier work this paper cites.
The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices
Zhouchen Lin, Minming Chen, Leqin Wu, and Yi Ma · 2009
Earlier work this paper cites.
Public-key cryptography from different assumptions
Benny Applebaum, Boaz Barak, and Avi Wigderson · 2010
Earlier work this paper cites.
A singular value thresholding algorithm for matrix completion
Jian-Feng Cai, Emmanuel J. Candès, and Zuowei Shen · 2010
Earlier work this paper cites.
The power of convex relaxation: Near-optimal matrix completion
Emmanuel J. Candes and Terence Tao · 2010
Earlier work this paper cites.
Note on sampling without replacing from a finite collection of matrices
David Gross and Vincent Nesme · 2010
Earlier work this paper cites.
Matrix completion from a few entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2010
Earlier work this paper cites.
Average-case complexity of detecting cliques
Benjamin Rossman · 2010
Cited alongside, same era.
Robust principal component analysis?
Emmanuel J. Candès, Xiaodong Li, Yi Ma, and John Wright · 2011
Cited alongside, same era.
Rank-sparsity incoherence for matrix decomposition
Venkat Chandrasekaran, Sujay Sanghavi, Pablo Parrilo, and Alan Willsky · 2011
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis
David Gross · 2011
Cited alongside, same era.
How hard is it to approximate the best nash equilibrium?
Elad Hazan and Robert Krauthgamer · 2011
Cited alongside, same era.
Robust matrix decomposition with sparse corruptions
Daniel Hsu, Sham M Kakade, and Tong Zhang · 2011
Cited alongside, same era.
Incoherence-optimal matrix completion
Yudong Chen · 2013
Closest in time.
Low-rank matrix recovery from errors and erasures
Yudong Chen, Ali Jalali, Sujay Sanghavi, and Constantine Caramanis · 2013
Closest in time.
Spectral compressed sensing via structured matrix completion
Yuxin Chen and Yuejie Chi · 2013
Closest in time.
Statistical algorithms and a lower bound for detecting planted cliques
Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, and Ying Xiao · 2013
Closest in time.
Low-rank matrix completion using alternating minimization
Prateek Jain, Praneeth Netrapalli, and Sujay Sanghavi · 2013
Closest in time.
Compressed sensing and matrix completion with constant proportion of corruptions
Xiaodong Li · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A simpler approach to matrix completion
Benjamin Recht · 2011
Cited alongside, same era.
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
Alekh Agarwal, Sahand Negahban, and Martin J Wainwright · 2012
Cited alongside, same era.
Hidden cliques and the certification of the restricted isometry property
Pascal Koiran and Anastasios Zouzias · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
Joel A. Tropp · 2012
Cited alongside, same era.
Complexity theoretic lower bounds for sparse principal component detection
Quenti Berthet and Philippe Rigollet · 2013
Cited alongside, same era.
Optimal detection of sparse principal components in high dimension
Quentin Berthet and Philippe Rigollet · 2013
Cited alongside, same era.
Closest in time.
Computational barriers in minimax submatrix detection
Zongming Ma and Yihong Wu · 2013
Closest in time.
Speedup matrix completion with side information: Application to multi-label learning
Miao Xu, Rong Jin, and Zhi-Hua Zhou · 2013
Closest in time.
Semi-supervised clustering by input pattern assisted pairwise similarity matrix completion
Jinfeng Yi, Lijun Zhang, Rong Jin, Qi Qian, and Anil Jain · 2013
Closest in time.
Coherent Matrix Completion
Yudong Chen, Srinadh Bhojanapalli, Sujay Sanghavi, and Rachel Ward · 2014
Closest in time.
Robust spectral compressed sensing via structured matrix completion
Yuxin Chen and Yuejie Chi · 2014
Closest in time.
Jointly clustering rows and columns of binary matrices: Algorithms and trade-offs
Jiaming Xu, Rui Wu, Kai Zhu, Bruce Hajek, R. Srikant, and Lei Ying · 2014
Closest in time.