Learning Mixtures of Gaussians

Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with weak performance guarantees. We present the first provably correct algorithm for learning a mixture of Gaussians. This algorithm is very simple and returns the true centers of the Gaussians to within the precision specified by the user, with high probability. It runs in time only linear in the dimension of the data and polynomial in the number of Gaussians.

• Type: Conference
• Year: 1999
• Where: FOCS
• Authors: Sanjoy Dasgupta
• Keywords: FOCS 1999, Local Search Heuristics, Mixtures, Theoretical Computer Science, Weak Performance Guarantees