Fetching the paper…
Reading the bibliography…
Learning a Gaussian mixture model (GMM) is a fundamental problem in machine learning, learning theory, and statistics.
Theory of Approximation of Functions of a Real Variable
Aleksandr F. Timan · 1963
Earlier work this paper cites.
On the computational complexity and geometry of the first-order theory of the reals. Part i: Introduction. Preliminaries. The geometry of semi-algebraic sets. the decision problem for the existential theory of the reals
James Renegar · 1992
Earlier work this paper cites.
On the computational complexity of approximating solutions for real algebraic formulae
James Renegar · 1992
Earlier work this paper cites.
Toward efficient agnostic learning
Michael J. Kearns, Robert E. Schapire, and Linda M. Sellie · 1994
Earlier work this paper cites.
Learning mixtures of Gaussians
Sanjoy Dasgupta · 1999
Earlier work this paper cites.
Combinatorial methods in density estimation
Luc Devroye and Gabor Lugosi · 2001
Earlier work this paper cites.
Learning mixtures of arbitrary Gaussians
Arora Sanjeev and Ravi Kannan · 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.
On the zeros of finite sums of exponential functions
Timo Tossavainen · 2006
Earlier work this paper cites.
Isotropic PCA and affine-invariant clustering
S. Charles Brubaker and Santosh Vempala · 2008
Cited alongside, same era.
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.
Settling the polynomial learnability of mixtures of Gaussians
Ankur Moitra and Gregory Valiant · 2010
Cited alongside, same era.
Modeling high-dimensional data: Technical perspective
Santosh S. Vempala · 2012
Cited alongside, same era.
Smoothed analysis of tensor decompositions
Aditya Bhaskara, Moses Charikar, Ankur Moitra, and Aravindan Vijayaraghavan · 2014
Later among the works it cites.
Statistical guarantees for the EM algorithm: From population to sample-based analysis
Sivaraman Balakrishnan, Martin J. Wainwright, and Bin Yu · 2014
Later among the works it cites.
Efficient density estimation via piecewise polynomial approximation
Siu-On Chan, Ilias Diakonikolas, Rocco Servedio, and Xiaorui Sun · 2014
Later among the works it cites.
Faster and sample near-optimal algorithms for proper learning mixtures of gaussians
Constantinos Daskalakis and Gautam Kamath · 2014
Later among the works it cites.
Algorithmic aspects of machine learning
Ankur Moitra · 2014
Later among the works it cites.
Sample-optimal density estimation in nearly-linear time
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Learning mixtures of structured distributions over discrete domains
Siu-On Chan, Ilias Diakonikolas, Rocco Servedio, and Xiaorui Sun · 2013
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.
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.
Near-optimal-sample estimators for spherical Gaussian mixtures
Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, and Ananda Theertha Suresh · 2014
Cited alongside, same era.
Contributions to the mathematical theory of evolution
Karl Pearson
Cited in the paper.
Jayadev Acharya, Ilias Diakonikolas, Jerry Li, and Ludwig Schmidt · 2015
Closest in time.
Handbook of Big Data
Peter Buhlmann, Petros Drineas, Michael John Kane, and Mark Van Der Laan · 2015
Closest in time.
Sparse solutions to nonnegative linear systems and applications
Aditja Bhaskara, Ananda Theertha Suresh, and Morteza Zadimoghaddam · 2015
Closest in time.
Learning mixtures of gaussians in high dimensions
Rong Ge, Qingqing Huang, and Sham M. Kakade · 2015
Closest in time.
Tight bounds for learning a mixture of two Gaussians
Moritz Hardt and Eric Price · 2015
Closest in time.