Stochastic Collapsed Variational Bayesian Inference for Latent Dirichlet Allocation

Authors
  • J. Foulds
  • L. Boyles
  • C. DuBois
  • P. Smyth
Publication date 2013
Host editors
  • I.S. Dhillon
  • Y. Koren
  • R. Ghani
  • T.E. Senator
  • P. Bradley
  • R. Parekh
  • J. He
  • R.L. Grossman
  • R. Uthurusamy
Book title KDD '13: the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining: August 11-14, 2013, Chicago, Illinois, USA
ISBN
  • 9781450321747
Event Conference on Knowledge Discovery and Data Mining (KDD)
Pages (from-to) 446-454
Publisher New York: ACM
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract
There has been an explosion in the amount of digital text information available in recent years, leading to challenges of scale for traditional inference algorithms for topic models. Recent advances in stochastic variational inference algorithms for latent Dirichlet allocation (LDA) have made it feasible to learn topic models on very large-scale corpora, but these methods do not currently take full advantage of the collapsed representation of the model. We propose a stochastic algorithm for collapsed variational Bayesian inference for LDA, which is simpler and more efficient than the state of the art method. In experiments on large-scale text corpora, the algorithm was found to converge faster and often to a better solution than previous methods. Human-subject experiments also demonstrated that the method can learn coherent topics in seconds on small corpora, facilitating the use of topic models in interactive document analysis software.
Document type Conference contribution
Language English
Published at https://doi.org/10.1145/2487575.2487697
Permalink to this page
Back