PAC learning axis-aligned mixtures of Gaussians with no separation assumption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4005 LNAI, Issue , 2006, Pages 20-34

  Feldman, Jon ^a   Servedio, Rocco A ^b   O'Donnell, Ryan ^c  

^a GOOGLE INC   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION ANALYSIS; MATHEMATICAL MODELS; METHOD OF MOMENTS; NUMBER THEORY; PROBABILITY DISTRIBUTIONS; STATISTICAL METHODS;

HYPOTHESIS MIXTURE; MINIMUM MIXING WEIGHT; SUBALGORITHMS;

LEARNING SYSTEMS;

EID: 33746089899     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_5     Document Type: Conference Paper

References (18)

1. D. Achlioptas and F. McSherry. On spectral learning of mixtures of distributions. In Proceedings of the 18th Annual COLT, pages 458-469, 2005.
2. S. Arora and R. Kannan. Learning mixtures of arbitrary Gaussians. In Proceedings of the 33rd Symposium on Theory of Computing, pages 247-257, 2001.
3. T. Cover and J. Thomas, Elements of Information Theory, Wiley, 1991.
4. M. Cryan, L. Goldberg, and P. Goldberg. Evolutionary trees can be learned in polynomial time in the two state general Markov model. SIAM Journal on Computing, 31(2):375-397, 2002.
5. S. Dasgupta, Learning mixtures of gaussians. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 634-644, 1999.
6. S. Dasgupta and L. Schulman. A Two-round Variant of EM for Gaussian Mixtures. In Proceedings of the 16th Conf. on UAI, pages 143-151, 2000.
7. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Stat. Soc. Ser. B, 39:1-38, 1977.
8. J. Feldman, R. O'Donnell, and R. Servedio. PAC learning mixtures of Gaussians with no separation assumption, Available at http://research.microsoft. com/~odonnell.
9. J. Feldman, R. O'Donnell, and R. Servedio. Learning mixtures of product distributions over discrete domains. In Proc. 46th IEEE FOCS, pages 501-510, 2005.
10. Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie. Efficient learning of typical finite automata from random walks. Information and Computation, 138(1):23-48, 1997.
11. Y. Freund and Y. Mansour. Estimating a mixture of two product distributions. In Proceedings of the 12th Annual COLT, pages 183-192, 1999.
12. R. Kannan, H. Salmasian, and S. Vempala. The spectral method for general mixture models. In Proceedings of the 18th Annual COLT, pages 444-457, 2005.
13. M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, and L. Sellie. On the learnability of discrete distributions. In Proc. 26th STOC, pages 273-282, 1994.
14. B. Lindsay. Mixture models: theory, geometry and applications. Institute for Mathematical Statistics, 1995.
15. M. Naor. Evaluation may be easier than generation. In Proceedings of the 28th Symposium on Theory of Computing (STOC), pages 74-83, 1996.
16. D.M. Titterington, A.F.M. Smith, and U.E. Makov. Statistical analysis of finite mixture distributions. Wiley & Sons, 1985.
17. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
18. S. Vempala and G. Wang. A spectral algorithm for learning mixtures of distributions. In Proceedings of the 43rd IEEE FOCS, pages 113-122, 2002.