Fetching the paper…
Reading the bibliography…
We consider sparse matrix estimation where the goal is to estimate an $n\times n$ matrix from noisy observations of a small subset of its entries.
On inverses of vandermonde and confluent vandermonde matrices
Walter Gautschi · 1962
Earlier work this paper cites.
Using collaborative filtering to weave an information tapestry
David Goldberg, David Nichols, Brian M. Oki, and Douglas Terry · 1992
Earlier work this paper cites.
Amazon.com recommendations: Item-to-item collaborative filtering
Greg Linden, Brent Smith, and Jeremy York · 2003
Earlier work this paper cites.
Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
Christian Borgs, Jennifer T Chayes, László Lovász, Vera T Sós, and Katalin Vesztergombi · 2008
Earlier work this paper cites.
Graph limits and exchangeable random graphs
Persi Diaconis and Svante Janson · 2008
Earlier work this paper cites.
Exact matrix completion via convex optimization
Emmanuel Candes and Benjamin Recht · 2009
Earlier work this paper cites.
Matrix completion with noise
Emmanuel J Candes and Yaniv Plan · 2010
Earlier work this paper cites.
The power of convex relaxation: Near-optimal matrix completion
Emmanuel J Candès and Terence Tao · 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.
Matrix completion from noisy entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2010
Earlier work this paper cites.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová · 2011
Earlier work this paper cites.
Advances in collaborative filtering
Yehuda Koren and Robert Bell · 2011
Earlier work this paper cites.
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
Sahand Negahban and Martin J Wainwright · 2011
Earlier work this paper cites.
A simpler approach to matrix completion
Benjamin Recht · 2011
Earlier work this paper cites.
Large networks and graph limits
László Lovász · 2012
Earlier work this paper cites.
Spectral redemption in clustering sparse networks
Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, and Pan Zhang · 2013
Earlier work this paper cites.
Nonparametric graphon estimation
Patrick J Wolfe and Sofia C Olhede · 2013
Earlier work this paper cites.
Christian Borgs, Jennifer T Chayes, Henry Cohn, and Yufei Zhao · 2014
Earlier work this paper cites.
Christian Borgs, Jennifer T Chayes, Henry Cohn, and Yufei Zhao · 2014
Cited alongside, same era.
1-bit matrix completion
Mark A Davenport, Yaniv Plan, Ewout van den Berg, and Mary Wootters · 2014
Cited alongside, same era.
Percolation on sparse networks
Brian Karrer, M. E. J. Newman, and Lenka Zdeborová · 2014
Cited alongside, same era.
Community detection thresholds and the weak ramanujan property
Laurent Massoulié · 2014
Cited alongside, same era.
Edge label inference in generalized stochastic block models: from spectral theory to impossibility results
Jiaming Xu, Laurent Massoulié, and Marc Lelarge · 2014
Cited alongside, same era.
Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery
Estimating network edge probabilities by neighborhood smoothing
Yuan Zhang, Elizaveta Levina, and Ji Zhu · 2015
Later among the works it cites.
Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic bp, and the information-computation gap
Emmanuel Abbe and Colin Sandon · 2016
Later among the works it cites.
Sparse exchangeable graphs and their limits via graphon processes
Christian Borgs, Jennifer T Chayes, Henry Cohn, and Nina Holden · 2016
Later among the works it cites.
Blind regression: Nonparametric regression for latent variable models via collaborative filtering
Christina E. Lee, Yihua Li, Devavrat Shah, and Dogyoon Song · 2016
Later among the works it cites.
Thy friend is my friend: Iterative collaborative filtering for sparse matrix estimation
Christian Borgs, Jennifer Chayes, Christina E. Lee, and Devavrat Shah · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Emmanuel Abbe and Colin Sandon · 2015
Cited alongside, same era.
Recovering communities in the general stochastic block model without knowing the parameters
Emmanuel Abbe and Colin Sandon · 2015
Cited alongside, same era.
Non-backtracking spectrum of random graphs: community detection and non-regular ramanujan graphs
Charles Bordenave, Marc Lelarge, and Laurent Massoulié · 2015
Cited alongside, same era.
Private graphon estimation for sparse graphs
Christian Borgs, Jennifer Chayes, and Adam Smith · 2015
Cited alongside, same era.
Consistent nonparametric estimation for heavy-tailed sparse graphs
Christian Borgs, Jennifer T Chayes, Henry Cohn, and Shirshendu Ganguly · 2015
Cited alongside, same era.
Matrix estimation by universal singular value thresholding
Sourav Chatterjee · 2015
Cited alongside, same era.
Yudong Chen and Martin J Wainwright · 2015
Cited alongside, same era.
Closest in time.
Oracle inequalities for network models and sparse graphon estimation
Olga Klopp, Alexandre B Tsybakov, Nicolas Verzelen, et al · 2017
Closest in time.
A proof of the block model threshold conjecture
Elchanan Mossel, Joe Neeman, and Allan Sly · 2017
Closest in time.
Bayesian estimation from few samples: community detection and related problems
David Steurer and Sam Hopkins · 2017
Closest in time.
Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval and matrix completion
Cong Ma, Kaizheng Wang, Yuejie Chi, and Yuxin Chen · 2018
Closest in time.
Rates of convergence of spectral methods for graphon estimation
Jiaming Xu · 2018
Closest in time.
Near-optimal bounds for phase synchronization
Yiqiao Zhong and Nicolas Boumal · 2018
Closest in time.
Changxiao Cai, Gen Li, Yuejie Chi, H Vincent Poor, and Yuxin Chen · 2019
Closest in time.
Spectral method and regularized mle are both optimal for top-k ranking
Yuxin Chen, Jianqing Fan, Cong Ma, and Kaizheng Wang · 2019
Closest in time.
Why are big data matrices approximately low rank?
Madeleine Udell and Alex Townsend · 2019
Closest in time.
Entrywise eigenvector analysis of random matrices with low expected rank
Emmanuel Abbe, Jianqing Fan, Kaizheng Wang, Yiqiao Zhong, et al · 2020
Closest in time.
Leave-one-out approach for matrix completion: Primal and dual analysis
Lijun Ding and Yudong Chen · 2020
Closest in time.
Nearest neighbors for matrix estimation interpreted as blind regression for latent variable model
Y. Li, D. Shah, D. Song, and C. L. Yu · 2020
Closest in time.