Algorithms of the LDA model [REPORT]
Machine Learning
2013-07-02 v1 Information Retrieval
Machine Learning
Abstract
We review three algorithms for Latent Dirichlet Allocation (LDA). Two of them are variational inference algorithms: Variational Bayesian inference and Online Variational 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.
Cite
@article{arxiv.1307.0317,
title = {Algorithms of the LDA model [REPORT]},
author = {Jaka Špeh and Andrej Muhič and Jan Rupnik},
journal= {arXiv preprint arXiv:1307.0317},
year = {2013}
}
Comments
5 pages, 4 figures, report