Fetching the paper…
Reading the bibliography…
We consider the problem of efficiently learning mixtures of a large number of spherical Gaussians, when the components of the mixture are well separated.
Identifiability of mixtures
Henry Teicher · 1961
Earlier work this paper cites.
Identifiability of mixtures of product measures
Henry Teicher · 1967
Earlier work this paper cites.
A lower bound for the smallest singular value of a matrix
J.M. Varah · 1975
Earlier work this paper cites.
Matrix Analysis
Rajendra Bhatia · 1997
Earlier work this paper cites.
Learning mixtures of Gaussians
Sanjoy Dasgupta · 1999
Earlier work this paper cites.
Adaptive estimation of a quadratic functional by model selection
B. Laurent and P. Massart · 2000
Earlier work this paper cites.
Learning mixtures of arbitrary Gaussians
Sanjeev Arora and Ravi Kannan · 2001
Earlier work this paper cites.
Theoretical numerical analysis : a functional analysis framework
Kendall Atkinson and Weimin Han · 2001
Earlier work this paper cites.
Spectral partitioning of random graphs
F. McSherry · 2001
Earlier work this paper cites.
A spectral algorithm for learning mixture models
Santosh Vempala and Grant Wang · 2004
Earlier work this paper cites.
On spectral learning of mixtures of distributions
Dimitris Achlioptas and Frank McSherry · 2005
Earlier work this paper cites.
PAC learning axis-aligned mixtures of Gaussians with no separation assumption
Jon Feldman, Rocco A. Servedio, and Ryan O’Donnell · 2006
Earlier work this paper cites.
An investigation of computational and informational limits in Gaussian mixture clustering
Nathan Srebro, Gregory Shakhnarovich, and Sam Roweis · 2006
Earlier work this paper cites.
A probabilistic analysis of EM for mixtures of separated, spherical Gaussians
Sanjoy Dasgupta and Leonard Schulman · 2007
Earlier work this paper cites.
Isotropic pca and affine-invariant clustering
Spencer Charles Brubaker and Santosh Vempala · 2008
Earlier work this paper cites.
The spectral method for general mixture models
Ravindran Kannan, Hadi Salmasian, and Santosh Vempala · 2008
Cited alongside, same era.
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.
Clustering with spectral norm and the k-means algorithm
Amit Kumar and Ravindran Kannan · 2010
Cited alongside, same era.
Settling the polynomial learnability of mixtures of Gaussians
Ankur Moitra and Gregory Valiant · 2010
Cited alongside, same era.
Center-based clustering under perturbation stability
Pranjal Awasthi, Avrim Blum, and Or Sheffet · 2012
Cited alongside, same era.
Faster and sample near-optimal algorithms for proper learning mixtures of Gaussians
Constantinos Daskalakis and Gautam Kamath · 2014
Later among the works it cites.
Fourier PCA and robust tensor decomposition
Navin Goyal, Santosh Vempala, and Ying Xiao · 2014
Later among the works it cites.
Community detection thresholds and the weak ramanujan property
Laurent Massoulié · 2014
Later among the works it cites.
Belief propagation, robust reconstruction and optimal recovery of block models
Elchanan Mossel, Joe Neeman, and Allan Sly · 2014
Later among the works it cites.
Near-optimal-sample estimators for spherical Gaussian mixtures
Ananda Theertha Suresh, Alon Orlitsky, Jayadev Acharya, and Ashkan Jafarpour · 2014
Later among the works it cites.
Sparse Solutions to Nonnegative Linear Systems and Applications
Aditya Bhaskara, Ananda Suresh, and Morteza Zadimoghaddam · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Improved spectral-norm bounds for clustering
Pranjal Awasthi and Or Sheffet · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
Joel A. Tropp · 2012
Cited alongside, same era.
Learning mixtures of spherical Gaussians: moment methods and spectral decompositions
Daniel Hsu and Sham M Kakade · 2013
Cited alongside, same era.
A proof of the block model threshold conjecture
Elchanan Mossel, Joe Neeman, and Allan Sly · 2013
Cited alongside, same era.
The more, the merrier: the blessing of dimensionality for learning large Gaussian mixtures
Joseph Anderson, Mikhail Belkin, Navin Goyal, Luis Rademacher, and James R. Voss · 2014
Cited alongside, same era.
Statistical guarantees for the EM algorithm: From population to sample-based analysis
Sivaraman Balakrishnan, Martin J. Wainwright, and Bin Yu · 2014
Cited alongside, same era.
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.
Tight bounds for learning a mixture of two Gaussians
Moritz Hardt and Eric Price · 2015
Later among the works it cites.
Community detection and the stochastic block model
Emmanuel Abbe · 2016
Later among the works it cites.
Ten steps of EM suffice for mixtures of two Gaussians
Constantinos Daskalakis, Christos Tzamos, and Manolis Zampetakis · 2016
Later among the works it cites.
Ilias Diakonikolas, Daniel M. Kane, and Alistair Stewart · 2016
Later among the works it cites.
http://dlmf.nist.gov/, Release 1.0.13 of 2016-09-16
NIST Digital Library of Mathematical Functions · 2016
Later among the works it cites.
Clustering subgaussian mixtures with k-means
D. G. Mixon, S. Villar, and R. Ward · 2016
Later among the works it cites.
Global analysis of expectation maximization for mixtures of two Gaussians
Ji Xu, Daniel J. Hsu, and Arian Maleki · 2016
Later among the works it cites.