skip to main content
research-article
Open Access

Learning topic models -- provably and efficiently

Published:26 March 2018Publication History
First page image

References

  1. Ahmed, A., Aly, M., Gonzalez, J., Narayanamurthy, S., Smola, A.J. Scalable inference in latent variable models. In WSDM '12: Proceedings of the fifth ACM international conference on Web search and data mining (New York, NY, USA, 2012), ACM, 123--132. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Anandkumar, A., Foster, D., Hsu, D., Kakade, S., Liu, Y. Two SVDs suffice: Spectral decompositions for probabilistic topic modeling and latent dirichlet allocation. In NIPS (2012). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Arora, S., Ge, R., Kannan, R., Moitra, A. Computing a nonnegative matrix factorization---Provably. In STOC (2012), 145--162. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Arora, S., Ge, R., Moitra, A. Learning topic models---Going beyond SVD. In FOCS (2012). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Blei, D. Introduction to probabilistic topic models. Commun. ACM (2012), 77--84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Blei, D., Lafferty, J. A correlated topic model of science. Ann. Appl. Stat. (2007), 17--35.Google ScholarGoogle Scholar
  7. Blei, D., Ng, A., Jordan, M. Latent dirichlet allocation. J. Mach. Learn. Res. (2003), 993--1022. Preliminary version in NIPS 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Deerwester, S., Dumais, S., Landauer, T., Furnas, G., Harshman, R. Indexing by latent semantic analysis. JASIS (1990), 391--407.Google ScholarGoogle Scholar
  9. Dempster, A.P., Laird, N.M., Rubin, D.B. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. Ser. B (1977), 1--38.Google ScholarGoogle Scholar
  10. Ding, W., Rohban, M.H., Ishwar, P., Saligrama, V. Efficient distributed topic modeling with provable guarantees. JMLR (2014), 167--175.Google ScholarGoogle Scholar
  11. Donoho, D., Stodden, V. When does non-negative matrix factorization give the correct decomposition into parts? In NIPS (2003). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Ge, R., Zou, J. Intersecting faces: Non-negative matrix factorization with new guarantees. In Proceedings of The 32nd International Conference on Machine Learning (2015), 2295--2303. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Griffiths, T.L., Steyvers, M. Finding scientific topics. Proc. Natl. Acad. Sci. 101 (2004), 5228--5235.Google ScholarGoogle ScholarCross RefCross Ref
  14. Hoffman, M.D., Blei, D.M. Structured stochastic variational inference. In 18th International Conference on Artificial Intelligence and Statistics (2015).Google ScholarGoogle Scholar
  15. Kalai, A.T., Moitra, A., Valiant, G. Disentangling gaussians. Commun. ACM 55, 2 (Feb. 2012), 113--120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Kivinen, J., Warmuth, M.K. Exponentiated gradient versus gradient descent for linear predictors. Inform. and Comput. 132 (1995). Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Lee, M., Bindel, D., Mimno, D.M. Robust spectral inference for joint stochastic matrix factorization. In NIPS (2015). Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Lee, M., Mimno, D. Low-dimensional embeddings for interpretable anchor-based topic inference. In EMNLP (2014).Google ScholarGoogle Scholar
  19. Li, W., McCallum, A. Pachinko allocation: Dag-structured mixture models of topic correlations. In ICML (2007), 633--640. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. McCallum, A. Mallet: A machine learning for language toolkit (2002). http://mallet.cs.umass.edu.Google ScholarGoogle Scholar
  21. Mimno, D., Wallach, H., Talley, E., Leenders, M., McCallum, A. Optimizing semantic coherence in topic models. In EMNLP (2011). Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Nguyen, T., Hu, Y., Boyd-Graber, J. Anchors regularized: Adding robustness and extensibility to scalable topic-modeling algorithms. In ACL (2014).Google ScholarGoogle Scholar
  23. Pearson, K. Contributions to the mathematical theory of evolution. Philos. Trans. R. Soc. Lond. A. 185 (1894), 71--110.Google ScholarGoogle ScholarCross RefCross Ref
  24. Roberts, M.E., Stewart, B.M., Tingley, D. Navigating the local modes of big data: The case of topic models. In Data Science for Politics, Policy and Government (Cambridge University Press, New York, 2014).Google ScholarGoogle Scholar
  25. Sontag, D., Roy, D. Complexity of inference in latent dirichlet allocation. In NIPS (2011), 1008--1016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Vavasis, S. On the complexity of nonnegative matrix factorization. SIAM J. Optim. (2009), 1364--1377.Google ScholarGoogle Scholar
  27. Zhou, T., Bilmes, J.A., Guestrin, C. Divide-and-conquer learning by anchoring a conical hull. In NIPS (2014), 1242--1250. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Learning topic models -- provably and efficiently

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image Communications of the ACM
        Communications of the ACM  Volume 61, Issue 4
        April 2018
        88 pages
        ISSN:0001-0782
        EISSN:1557-7317
        DOI:10.1145/3200906
        Issue’s Table of Contents

        Copyright © 2018 Owner/Author

        Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 26 March 2018

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format