Algorithms of the LDA model [REPORT]

ABSTRACT We review three algorithms for Latent Dirichlet Allocation (LDA). Two of them are variational inference algorithms: V ariational Bayesian inference and Online V ariational Bayesian inference and one is Markov Chain Monte Carlo (MCMC) algorithm - Collapsed Gibbs sampling. We compare their time complexity and performance. We find that online variational Bayesian inference is the fastest algorithm and still returns reasonably good results. 1 INTRODUCTION Nowadays big corpora are used daily. People often search through huge numbers of documents either in libraries or online, using web search engines.