Fetching the paper…
Reading the bibliography…
The problem of low-rank matrix completion has recently generated a lot of interest leading to several results that offer exact solutions to the problem.
Ramanujan graphs
Lubotzky, Alexander, Phillips, Ralph, and Sarnak, Peter · 1988
Earlier work this paper cites.
Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
Margulis, Grigorii Aleksandrovich · 1988
Earlier work this paper cites.
Existence and explicit constructions of q+ 1 regular ramanujan graphs for every prime power q
Morgenstern, Moshe · 1994
Earlier work this paper cites.
A proof of alon’s second eigenvalue conjecture
Friedman, Joel · 2003
Earlier work this paper cites.
Decoding by linear programming
Candes, Emmanuel J and Tao, Terence · 2005
Earlier work this paper cites.
Spectral techniques applied to sparse random graphs
Feige, Uriel and Ofek, Eran · 2005
Earlier work this paper cites.
Expander graphs and their applications
Hoory, Shlomo, Linial, Nathan, and Wigderson, Avi · 2006
Earlier work this paper cites.
Exact matrix completion via convex optimization
Candès, Emmanuel J and Recht, Benjamin · 2009
Earlier work this paper cites.
Matrix completion from power-law distributed samples
Meka, Raghu, Jain, Prateek, and Dhillon, Inderjit S · 2009
Earlier work this paper cites.
A simpler approach to matrix completion
Recht, Benjamin · 2009
Cited alongside, same era.
Matrix completion with noise
Candes, Emmanuel J and Plan, Yaniv · 2010
Cited alongside, same era.
The power of convex relaxation: Near-optimal matrix completion
Candès, Emmanuel J and Tao, Terence · 2010
Cited alongside, same era.
Quantum state tomography via compressed sensing
Gross, David, Liu, Yi-Kai, Flammia, Steven T, Becker, Stephen, and Eisert, Jens · 2010
Cited alongside, same era.
Matrix completion from a few entries
Keshavan, Raghunandan H, Montanari, Andrea, and Oh, Sewoong · 2010
Cited alongside, same era.
The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices
Low-rank matrix completion using alternating minimization
Jain, Prateek, Netrapalli, Praneeth, and Sanghavi, Sujay · 2012
Later among the works it cites.
A combinatorial algebraic approach for the identifiability of low-rank matrix completion
Király, Franz J. and Tomioka, Ryota · 2012
Later among the works it cites.
Graph spectra and the detectability of community structure in networks
Nadakuditi, Raj Rao and Newman, Mark EJ · 2012
Later among the works it cites.
Chen, Yudong, Bhojanapalli, Srinadh, Sanghavi, Sujay, and Ward, Rachel · 2013
Later among the works it cites.
One-bit compressed sensing: Provable support and vector recovery
Gopi, Sivakant, Netrapalli, Praneeth, Jain, Prateek, and Nori, Aditya · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Lin, Zhouchen, Chen, Minming, and Ma, Yi · 2010
Cited alongside, same era.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Recht, Benjamin, Fazel, Maryam, and Parrilo, Pablo A · 2010
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis
Gross, David · 2011
Cited alongside, same era.
Universal low-rank matrix recovery from pauli measurements
Liu, Yi-Kai · 2011
Cited alongside, same era.
National climatic data center
NCDC
Cited in the paper.
Deterministic algorithms for matrix completion
Heiman, Eyal, Schechtman, Gideon, and Shraibman, Adi · 2013
Later among the works it cites.
Matrix completion from any given set of observations
Lee, Troy and Shraibman, Adi · 2013
Later among the works it cites.
Interlacing families i: Bipartite ramanujan graphs of all degrees
Marcus, Adam, Spielman, Daniel A, and Srivastava, Nikhil · 2013
Later among the works it cites.