A method of moments for mixture models and hidden markov models

Journal of Machine Learning Research

Volumn 23, Issue , 2012, Pages

  Anandkumar, Animashree ^a   Hsu, Daniel ^b   Kakade, Sham M ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HIDDEN MARKOV MODELS; METHOD OF MOMENTS;

APPLIED STATISTICS; CURRENT PRACTICES; FUNDAMENTAL TOOLS; HIGH-DIMENSIONAL; LOCAL SEARCH HEURISTICS; MIXTURE COMPONENTS; MIXTURES OF GAUSSIANS; SAMPLE COMPLEXITY;

MIXTURES;

EID: 84893458195     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (40)

1. D. Achlioptas and F. McSherry. On spectral learning of mixtures of distributions. In COLT, 2005.
2. R. Ahlswede and A. Winter. Strong converse for identification via quantum channels. IEEE Transactions on Information Theory, 48(3):569-579, 2002.
3. S. Arora and R. Kannan. Learning mixtures of arbitrary Gaussians. In STOC, 2001.
4. M. Belkin and K. Sinha. Polynomial learning of distribution families. In FOCS, 2010.
5. M. B. Blaschko and C. H. Lampert. Correlational spectral clustering. In CVPR, 2008.
6. D. L. Boley, F. T. Luk, and D. Vandevoorde. Vandermonde factorization of a Hankel matrix. In Scientific Computing, 1997.
7. S. C. Brubaker and S. Vempala. Isotropic PCA and affine-invariant clustering. In FOCS, 2008.
8. J. T. Chang. Full reconstruction of Markov models on evolutionary trees: Identifiability and consistency. Mathematical Biosciences, 137:51-73, 1996.
9. K. Chaudhuri and S. Rao. Learning mixtures of product distributions using correlations and independence. In COLT, 2008.
10. K. Chaudhuri, S. M. Kakade, K. Livescu, and K. Sridharan. Multi-view clustering via canonical correlation analysis. In ICML, 2009.
11. S. Dasgupta. Learning mixutres of Gaussians. In FOCS, 1999.
12. S. Dasgupta and A. Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures and Algorithms, 22(1):60-65, 2003.
13. S. Dasgupta and L. Schulman. A probabilistic analysis of EM for mixtures of separated, spherical Gaussians. Journal of Machine Learning Research, 8(Feb):203-226, 2007.
14. J. Feldman, R. O'Donnell, and R. Servedio. Learning mixtures of product distributions over discrete domains. In FOCS, 2005.
15. J. Feldman, R. O'Donnell, and R. Servedio. PAC learning mixtures of axis-aligned Gaussians with no separation assumption. In COLT, 2006.
16. A. M. Frieze, M. Jerrum, and R. Kannan. Learning linear transformations. In FOCS, 1996.
17. W. A. Gale, K. W. Church, and D. Yarowsky. One sense per discourse. In 4th DARPA Speech and Natural Language Workshop, 1992.
18. N. Gravin, J. Lasserre, D. Pasechnik, and S. Robins. The inverse moment problem for convex polytopes. Discrete and Computational Geometry, 2012. To appear.
19. H. Hotelling. The most predictable criterion. Journal of Educational Psychology, 26(2):139-142, 1935.
20. D. Hsu, S. M. Kakade, and T. Zhang. A spectral algorithm for learning hidden Markov models. In COLT, 2009.
21. D. Hsu, S. M. Kakade, and T. Zhang. A spectral algorithm for learning hidden Markov models. Journal of Computer and System Sciences, 2012. To appear.
22. A. Hyv̈arinen and E. Oja. Independent component analysis: Algorithms and applications. Neural Networks, 13(4-5):411-430, 2000.
23. H. Jaeger. Observable operator models for discrete stochastic time series. Neural Computation, 12 (6), 2000.
24. A. T. Kalai, A. Moitra, and G. Valiant. Efficiently learning mixtures of two Gaussians. In STOC, 2010.
25. R. Kannan, H. Salmasian, and S. Vempala. The spectral method for general mixture models. In COLT, 2005.
26. B. G. Lindsay. Moment matrices: Applications in mixtures. Annals of Statistics, 17(2):722-740, 1989.
27. B. G. Lindsay. Mixture models: Theory, geometry and applications. American Statistical Association, 1995.
28. B. G. Lindsay and P. Basak. Multivariate normal mixtures: A fast consistent method. Journal of the American Statistical Association, 88(422):468-476, 1993.
29. F. McSherry. Spectral partitioning of random graphs. In FOCS, 2001.
30. A. Moitra and G. Valiant. Settling the polynomial learnability of mixtures of Gaussians. In FOCS, 2010.
31. E. Mossel and S. Roch. Learning nonsingular phylogenies and hidden Markov models. Annals of Applied Probability, 16(2):583-614, 2006.
32. P. Q. Nguyen and O. Regev. Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures. Journal of Cryptology, 22(2):139-160, 2009.
33. K. Pearson. Contributions to the mathematical theory of evolution. Philosophical Transactions of the Royal Society, London, A., page 71, 1894.
34. B. Recht. A simpler approach to matrix completion, 2009. arXiv:0910.0651v2.
35. R. A. Redner and H. F. Walker. Mixture densities, maximum likelihood and the EM algorithm. SIAM Review, 26(2):195-239, 1984.
36. M. P. Scḧutzenberger. On the definition of a family of automata. Information and Control, 4: 245-270, 1961.
37. G. W. Stewart and Ji-Guang Sun. Matrix Perturbation Theory. Academic Press, 1990.
38. D. M. Titterington, A. F. M. Smith, and U. E. Makov. Statistical analysis of finite mixture distributions. Wiley, 1985.
39. S. Vempala and G. Wang. A spectral algorithm for learning mixtures of distributions. In FOCS, 2002.
40. R. Vershynin. Introduction to the non-asymptotic analysis of random matrices. In Y. Eldar and G. Kutyniok, editors, Compressed Sensing, Theory and Applications, chapter 5, pages 210-268. Cambridge University Press, 2012.