A spectral algorithm for learning mixtures of distributions
- 26 June 2003
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We show that a simple spectral algorithm for learning a mixture of k spherical Gaussians in /spl Ropf//sup n/ works remarkably well - it succeeds in identifying the Gaussians assuming essentially the minimum possible separation between their centers that keeps them unique. The sample complexity and running time are polynomial in both n and k. The algorithm also works for the more general problem of learning a mixture of "weakly isotropic" distributions (e.g. a mixture of uniform distributions on cubes).Keywords
This publication has 6 references indexed in Scilit:
- Learning mixtures of GaussiansPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Fast Monte-Carlo algorithms for finding low-rank approximationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Spectral analysis of dataPublished by Association for Computing Machinery (ACM) ,2001
- Latent Semantic Indexing: A Probabilistic AnalysisJournal of Computer and System Sciences, 2000
- Isoperimetric problems for convex bodies and a localization lemmaDiscrete & Computational Geometry, 1995
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue ProblemsSiam Review, 1973