Fetching the paper…
Reading the bibliography…
We study the problem of matrix estimation and matrix completion under a general framework.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1963
Earlier work this paper cites.
Direct clustering of a data matrix
John A Hartigan · 1972
Earlier work this paper cites.
Stochastic blockmodels: First steps
Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
Sparse coding with an overcomplete basis set: A strategy employed by v1?
Bruno A Olshausen and David J Field · 1997
Earlier work this paper cites.
Learning mixtures of gaussians
S. Dasgupta · 1999
Earlier work this paper cites.
Information-theoretic determination of minimax rates of convergence
Yuhong Yang and Andrew Barron · 1999
Earlier work this paper cites.
Biclustering of expression data
Yizong Cheng and George M Church · 2000
Earlier work this paper cites.
A two-round variant of em for gaussian mixtures
Sanjoy Dasgupta and Leonard J. Schulman · 2000
Earlier work this paper cites.
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Dimitris Achlioptas · 2001
Earlier work this paper cites.
A spectral algorithm for learning mixture models
Santosh Vempala and Grant Wang · 2004
Earlier work this paper cites.
Mixed membership stochastic blockmodels
Edoardo M Airoldi, David M Blei, Stephen E Fienberg, and Eric P Xing · 2008
Earlier work this paper cites.
Learning mixtures of gaussians using the k-means algorithm
Kamalika Chaudhuri, Sanjoy Dasgupta, and Andrea Vattani · 2009
Earlier work this paper cites.
Introduction to nonparametric estimation
Alexandre B. Tsybakov · 2009
Earlier work this paper cites.
Polynomial learning of distribution families
Mikhail Belkin and Kaushik sinha · 2010
Earlier work this paper cites.
Matrix completion with noise
Emmanuel J Candes and Yaniv Plan · 2010
Cited alongside, same era.
The power of convex relaxation: near-optimal matrix completion
Emmanuel J. Candès and Terence Tao · 2010
Cited alongside, same era.
Matrix completion from noisy entries
Raghunandan H. Keshavan, Andrea Montanari, and Sewoong Oh · 2010
Cited alongside, same era.
Concentration-based guarantees for low-rank matrix reconstruction
R. Foygel and N. Srebro · 2011
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis
David Gross · 2011
Cited alongside, same era.
Stochastic blockmodels and community structure in networks
Brian Karrer and Mark EJ Newman · 2011
Cited alongside, same era.
Learning mixtures of spherical gaussians: Moment methods and spectral decompositions
Daniel Hsu and Sham M. Kakade · 2013
Later among the works it cites.
Nonparametric graphon estimation
Patrick J. Wolfe and Sofia C. Olhede · 2013
Later among the works it cites.
A consistent histogram estimator for exchangeable graph models
Stanley H. Chan and Edoardo M. Airoldi · 2014
Later among the works it cites.
Matrix estimation by universal singular value thresholding
Sourav Chatterjee · 2014
Later among the works it cites.
Noisy low-rank matrix completion with general sampling distribution
O. Klopp · 2014
Later among the works it cites.
Edge Label Inference in Generalized Stochastic Block Models: from Spectral Theory to Impossibility Results
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Rank penalized estimators for high-dimensional matrices
O. Klopp · 2011
Cited alongside, same era.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
V. Koltchinskii, K. Lounici, and A. B. Tsybakov · 2011
Cited alongside, same era.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Vladimir Koltchinskii, Karim Lounici, and Alexandre B. Tsybakov · 2011
Cited alongside, same era.
Exponential screening and optimal rates of sparse estimation
P. Rigollet and A. Tsybakov · 2011
Cited alongside, same era.
A tail inequality for quadratic forms of subgaussian random vectors
Daniel Hsu, Sham M. Kakade, and Tong Zhang · 2012
Cited alongside, same era.
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
S. Negahban and M. J. Wainwright · 2012
Cited alongside, same era.
Jiaming Xu, Laurent Massoulié, and Marc Lelarge · 2014
Later among the works it cites.
Private graphon estimation for sparse graphs
Christian Borgs, Jennifer Chayes, and Adam Smith · 2015
Later among the works it cites.
Rate-optimal graphon estimation
Chao Gao, Yu Lu, and Harrison H Zhou · 2015
Later among the works it cites.
Sharp nonasymptotic bounds on the norm of random matrices with independent entries
Afonso S. Bandeira and Ramon van Handel · 2016
Later among the works it cites.
Matrix completion via max-norm constrained optimization
T. Tony Cai and Wen-Xin Zhou · 2016
Later among the works it cites.
Optimal estimation and completion of matrices with biclustering structures
Chao Gao, Yu Lu, Zongming Ma, and Harrison H. Zhou · 2016
Later among the works it cites.
Noisy matrix completion under sparse factor models
A. Soni, S. Jain, J. Haupt, and S. Gonella · 2016
Later among the works it cites.
Oracle inequalities for network models and sparse graphon estimation
Olga Klopp, Alexandre B. Tsybakov, and Nicolas Verzelen · 2017
Closest in time.