Blei et al Latent Dirichlet Allocation

Citation

author = {Blei, David M. and Ng, Andrew Y. and Jordan, Michael I.},
title = {Latent dirichlet allocation},
journal = {J. Mach. Learn. Res.},
issue_date = {3/1/2003},
volume = {3},
month = mar,
year = {2003},
issn = {1532-4435},
pages = {993--1022},
numpages = {30},
url = {http://dl.acm.org/citation.cfm?id=944919.944937},
acmid = {944937},
publisher = {JMLR.org}

Online Version

Latent Dirichlet Allocation

Summary

This paper addresses the problem of document modeling

LDA

LDA is a generative probabilistic model for discrete data such as text corpora. It is a Bayesian model that consists of three hierarchies. Each item of the collection is modeled as a ﬁnite mixture i.e. modeled as being generated by an underlying (latent) set of topics, where each topic is characterized by a distribution over words. Each document $d$ in the corpus is assumed to be generated using the following process:

 # The author chooses the number of words  $N_{d}$  in the document by drawing from a Poisson( $\xi$ ) distribution. 
 # He then tosses a Dirichlet hypergenerator Dirichlet( $\alpha$ �) to get a  $\theta _{d,n}$  �which is used to generate a Multinomial({ $\theta _{d,n}$ ) topiv generator
 # For each word  $w_{d,n}$  from the  $N_{d}$  words
   a. A topic  $z_{d,n}$  is chosen from a Multinomial({ $\theta _{d,n}$ ) distribution
   b. A topic specific word generator parametrized by  $w_{d,n}$  is then tossed to get the word

The parameters $\alpha$ and $\beta$ are corpus level parameters, assumed to be sampled once in the process of generating a corpus. The variables $\theta _{d,n}$ are document-level variables, sampled once per document. Finally, the variables $z_{d,n}$ and $w_{d,n}$ are word-level variables and are sampled once for each word in each document.

Inference

The posterior distribution of the hidden variables given a document is intractable. Efﬁcient approximate inference techniques based on variational methods and an EM algorithm for empirical Bayes parameter estimation are provided.

The basic idea is to make use of Jensen’s inequality to obtain an adjustable lower bound on the log likelihood. A family of lower bounds, indexed by a set of variational parameters, is considered and the variational parameters are chosen by an optimization procedure that attempts to ﬁnd the tightest possible lower bound. It leads to the following iterative EM algorithm

 1. E step: For each document, find the optimizing values of the variational parameters
 2. M step: Maximize resulting lower bound on the log likelihood with respect to the model parameters  $\alpha ,\beta$