Fetching the paper…
Reading the bibliography…
We consider the problem of accurately recovering a matrix B of size M by M , which represents a probability distribution over M2 outcomes, given access to an observed matrix of "counts" generated by taking independent samples from the distribution B.
Stochastic blockmodels: First steps
Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
Estimating a density under order restrictions: Nonasymptotic minimax risk
L. Birge · 1987
Earlier work this paper cites.
On the second eigenvalue of random regular graphs
Joel Friedman, Jeff Kahn, and Endre Szemeredi · 1989
Earlier work this paper cites.
Full reconstruction of Markov models on evolutionary trees: Identifiability and consistency
J. T. Chang · 1996
Earlier work this paper cites.
Latent semantic indexing: A probabilistic analysis
Christos H Papadimitriou, Hisao Tamaki, Prabhakar Raghavan, and Santosh Vempala · 1998
Earlier work this paper cites.
Learning mixtures of gaussians
Sanjoy Dasgupta · 1999
Earlier work this paper cites.
Probabilistic latent semantic indexing
Thomas Hofmann · 1999
Earlier work this paper cites.
On testing expansion in bounded-degree graphs
O. Goldreich and D. Ron · 2000
Earlier work this paper cites.
Latent dirichlet allocation
David M Blei, Andrew Y Ng, and Michael I Jordan · 2003
Earlier work this paper cites.
Sublinear algorithms for testing monotone and unimodal distributions
T. Batu, R. Kumar, and R. Rubinfeld · 2004
Earlier work this paper cites.
Estimating entropy on m m bins given fewer than m m samples
L. Paninski · 2004
Earlier work this paper cites.
A spectral algorithm for learning mixture models
Santosh Vempala and Grant Wang · 2004
Earlier work this paper cites.
Spectral techniques applied to sparse random graphs
Uriel Feige and Eran Ofek · 2005
Earlier work this paper cites.
Probability and computing: Randomized algorithms and probabilistic analysis
Michael Mitzenmacher and Eli Upfal · 2005
Earlier work this paper cites.
Nonnegative matrix factorization and probabilistic latent semantic indexing: Equivalence chi-square statistic, and a hybrid method
Chris Ding, Tao Li, and Wei Peng · 2006
Earlier work this paper cites.
Streaming and sublinear approximation of entropy and information distances
S. Guha, A. McGregor, and S. Venkatasubramanian · 2006
Earlier work this paper cites.
Learning nonsingular phylogenies and hidden Markov models
E. Mossel and S. Roch · 2006
Earlier work this paper cites.
Matrix completion from a few entries
Raghunandan H Keshavan, Sewoong Oh, and Andrea Montanari · 2009
Earlier work this paper cites.
Strong lower bounds for approximating distribution support size and the distinct elements problem
S. Raskhodnikova, D. Ron, A. Shpilka, and A. Smith · 2009
Earlier work this paper cites.
Polynomial learning of distribution families
Mikhail Belkin and Kaushik Sinha · 2010
Cited alongside, same era.
Efficiently learning mixtures of two gaussians
Adam Tauman Kalai, Ankur Moitra, and Gregory Valiant · 2010
Cited alongside, same era.
Settling the polynomial learnability of mixtures of gaussians
Ankur Moitra and Gregory Valiant · 2010
Cited alongside, same era.
Competitive closeness testing
J. Acharya, H. Das, A. Jafarpour, A. Orlitsky, and S. Pan · 2011
Cited alongside, same era.
Estimating the unseen: an n / log n n/\log n -sample estimator for entropy and support size, shown optimal via new clts
G. Valiant and P. Valiant · 2011
Cited alongside, same era.
The power of linear estimators
G. Valiant and P. Valiant · 2011
Cited alongside, same era.
Tensor decompositions for learning latent variable models
Animashree Anandkumar, Rong Ge, Daniel Hsu, Sham M. Kakade, and Matus Telgarsky · 2014
Later among the works it cites.
Smoothed analysis of tensor decompositions
Aditya Bhaskara, Moses Charikar, Ankur Moitra, and Aravindan Vijayaraghavan · 2014
Later among the works it cites.
Neural word embedding as implicit matrix factorization
Omer Levy and Yoav Goldberg · 2014
Later among the works it cites.
Community detection thresholds and the weak ramanujan property
Laurent Massoulié · 2014
Later among the works it cites.
Consistency thresholds for binary symmetric block models
Elchanan Mossel, Joe Neeman, and Allan Sly · 2014
Later among the works it cites.
Optimal algorithms for testing closeness of discrete distributions
S. on Chan, I. Diakonikolas, G. Valiant, and P. Valiant · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Singular vectors under random perturbation
Van Vu · 2011
Cited alongside, same era.
Competitive classification and closeness testing
J. Acharya, H. Das, A. Jafarpour, A. Orlitsky, and S. Pan · 2012
Cited alongside, same era.
A spectral algorithm for latent dirichlet allocation
Anima Anandkumar, Yi kai Liu, Daniel J. Hsu, Dean P Foster, and Sham M Kakade · 2012
Cited alongside, same era.
Computing a nonnegative matrix factorization–provably
Sanjeev Arora, Rong Ge, Ravindran Kannan, and Ankur Moitra · 2012
Cited alongside, same era.
Learning topic models–going beyond svd
Sanjeev Arora, Rong Ge, and Ankur Moitra · 2012
Cited alongside, same era.
A spectral algorithm for learning hidden markov models
Daniel Hsu, Sham M Kakade, and Tong Zhang · 2012
Cited alongside, same era.
Later among the works it cites.
A spectral algorithm for learning class-based n-gram models of natural language
Karl Stratos, Michael Collins Do-Kyum Kim, and Daniel Hsu · 2014
Later among the works it cites.
An automatic inequality prover and instance optimal identity testing
G. Valiant and P. Valiant · 2014
Later among the works it cites.
Emmanuel Abbe and Colin Sandon · 2015
Later among the works it cites.
Random walks on context spaces: Towards an explanation of the mysteries of semantic word embeddings
Sanjeev Arora, Yuanzhi Li, Yingyu Liang, Tengyu Ma, and Andrej Risteski · 2015
Later among the works it cites.
Random walks on context spaces: Towards an explanation of the mysteries of semantic word embeddings
Sanjeev Arora, Yuanzhi Li, Yingyu Liang, Tengyu Ma, and Andrej Risteski · 2015
Later among the works it cites.
Testing closeness with unequal sized samples
B. Bhattacharya and G. Valiant · 2015
Later among the works it cites.
Peter Chin, Anup Rao, and Van Vu · 2015
Later among the works it cites.
Learning mixtures of gaussians in high dimensions
Rong Ge, Qingqing Huang, and Sham M. Kakade · 2015
Later among the works it cites.
Sparse random graphs: regularization and concentration of the laplacian
Can Le, Elizaveta Levina, and Roman Vershynin · 2015
Later among the works it cites.
Concentration and regularization of random graphs
Can Le and Roman Vershynin · 2015
Later among the works it cites.
Model-based word embeddings from decompositions of count matrices
Karl Stratos, Michael Collins, and Daniel Hsu · 2015
Later among the works it cites.
Emmanuel Abbe and Colin Sandon · 2016
Closest in time.