Download
an introduction to latent dirichlet allocation lda n.
Skip this Video
Loading SlideShow in 5 Seconds..
An Introduction to Latent Dirichlet Allocation (LDA) PowerPoint Presentation
Download Presentation
An Introduction to Latent Dirichlet Allocation (LDA)

An Introduction to Latent Dirichlet Allocation (LDA)

2138 Vues Download Presentation
Télécharger la présentation

An Introduction to Latent Dirichlet Allocation (LDA)

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. An Introduction to Latent Dirichlet Allocation (LDA) David M. Blei, Andrew Y. Ng, and Michael I. Jordan. Latent Dirichlet Allocation. Journal of Machine Learning Research 3 (2003): 993-1022

  2. LDA • A generative probabilistic model for collections of discrete data such text corpora. • Is a three-level hierarchical Bayesian model, in which each item of a collection is modeled as finite mixture over an underlying set of topics. • Each topic again is modeled as an infinite mixture of an underlying set of topic probabilities. • It has natural advantages over unigram model and probabilistic LSI model.

  3. History (1) – text processing • IR – text to real number vector(Baeza-Yates and Ribeiro-Neto, 1999), tfidf (Salton and McGill, 1983) • Tfidf – shortcoming: (1) Lengthy and (2) Cannot model inter- and intra- document statistical structure • LSI – dimension reduction (Deerwester et al., 1990) • Advantages: achieve significant compression in large collections and capture synonymy and polysemy. • Generative probabilistic model – to study the ability of LSI (Papadimitriou et al., 1998) • Why LSI, we can model the data directly using maximum likelihood or Bayesian methods.

  4. History (2) – text processing • Probabilistic LSI – also aspect model. Milestone (Hofmann, 1999). • P(wi|θj), d={w1, …, wN}, and θ={θ1, …, θk}. each word is generated from a single model θj. Document d is considered to be a mixing proportions for these mixture components θ, that is a list of numbers (the mixing proportions for topics). • Disadvantage: no probabilistic model at document level. • The number of parameters grows linearly with the size of corpora. • It is not clear to assign probability to document outside of the collection.(does not make any assumptions about how the mixture weights θ are generated, making it difficult to test the generalizability of the model to new documents. )

  5. Notation • D={d1, …, dM}, d={w1, …, wN}, • and θ={θ1, …, θk}, equivalently D={w1, …,wM}. (Bold variable denotes vector.) • Suppose we have V distinct words in the whole data set.

  6. LDA • The basic idea: Documents are represented as random mixtures over latent topics, where each topic is characterized by a distribution over words. • For each document d, we generate as follows: k topics z

  7. Dirichlet Random Variables θ • A k-dimensional Dirichlet random variables θ can take values in the (k-1)-simplex (a k-vector θlies in the (k-1)-simplex if , and thus the probability density can be: • where α is a k-vector parameter with αi>0, and Γ(x) is a gamma function

  8. Multinomial Distribution • Each trial can end in exactly one of k categories • n independent trials • Probability a trial results in category i is pi • Yi is the number of trials resulting in category I • p1+…+pk = 1 • Y1+…+Yk = n

  9. Multinomial Distribution

  10. Conjugation

  11. Entropy

  12. Joint Distribution • Given the parameters α and β, the joint distribution of a topic mixture θ, a set of N topics z, and a set of N words w is given by: where p(zn|θ) is simply θi for the unique i such that zni=1. Integrating over θ and summing over z we obtain the marginal distribution of a document (a)

  13. Joint Distribution (cont.) • Finally, taking the product of the marginal probabilities of single documents, we can obtain the probability of a corpus: Similar model can be referred to hierarchical models (Gelman et al., 1995), or more precisely as conditionally independent hierarchical models (Kass and Steffey, 1989).

  14. Relationships with Other Latent Models Problems: (1) p(z|d) only model the documents in the training data set and cannot for the unseen document; and (2) the parameter kV+kM grows linearly in M and thus overfitting.

  15. Graphical Interpretation The probability density of the Dirichlet distribution when K=3 for various parameter vectors α. Clockwise from top left: α=(6, 2, 2), (3, 7, 5), (6, 2, 6), (2, 3, 4).

  16. Graphical Interpretation (cont.) • The Dirichlet prior on the topic-word distributions can be interpreted as forces on the topic locations with higher β moving the topic locations away from the corners of the simplex.

  17. Matrix Interpretation • In the topic model, the word-document co-occurrence matrix is split into two parts: a topic matrix Φ and a document matrix Θ. Note that the diagonal matrix D in LSA can be absorbed in the matrix U or V, making the similarity between the two representations even clearer.

  18. Inference and Parameter Estimation • The key inferential problem is that of computing the posterior distribution of the hidden variables given a document: • However, such distribution is intractable to compute in general. For normalization in the above distribution, we have to marginalize over the hidden variables and write the Equation (a) in terms of the model parameters:

  19. Inference and Parameter Estimation • The key inferential problem is that of computing the posterior distribution of the hidden variables given a document: • However, such distribution is intractable to compute in general. For normalization in the above distribution, we have to marginalize over the hidden variables and write the Equation (a) in terms of the model parameters:

  20. Inference and Parameter Estimation (cont.) • This function is intractable due to the coupling between θ and β in the summation over latent topics (Dickey, 1983). • Rather than the intractable exact inference, we can use some other approximate inference algorithms, e.g., Laplace approximation, variational approximation, and Markov chain Monte Carlo (Jordan, 1999).

  21. Variational Inference • Here, we introduce a simple convexity-based variational algorithm for inference in LDA. • The basic idea here is to make use of Jensen’s inequality to obtain an adjustable lower bound on the log likelihood (Jordan, 1999). • A simple way to obtain a tractable family of lower bounds is to consider simple modifications of the original graphical model in which some of the edges and nodes are removed.

  22. Variational Inference (cont.) • Hence, by dropping edges between θ, z, and w, and w nodes, and also endow the resulting simplified graphical model with free variational parameters, we obtain a family of distributions on the latent variables: • where the Dirichlet parameter γ and the multinomial parameters (Φ1, …, ΦN) are the free variational parameters.

  23. Variational Inference (cont.) • We can set up an optimization problem to determine the values of the variational parameters γ and Φ. • We can define the optimization function as minimizing the Kullback-Leibler (KL) divergence between the variational distribution and the true posterior p(θ,z|w,α,β): • This minimization can be achieved by an iterative fixed-point method. (5)

  24. Variational Inference • We now discuss how to set the parameter γ and Φ via an optimization procedure. • Following Jordan et al. (1999), we have a lower bound of the log likelihood of a document using Jensen’s inequality:

  25. Variational Inference (cont.) • Then from the above formula, we see that the Jensen’s inequality provides us with a lower bound on the log likelihood for an arbitrary variational distribution q(θ,z|γ,Φ). • It can be easily verified that the difference between the left-hand side and the right-hand side of the above equation is the KL divergence between the variational posterior probability and the true posterior probability.

  26. Variational Inference (cont.) • That is, letting denote the right-hand side of the above equation we have: • This means that maximizing the lower bound w.r.t. γ and Φ is equivalent to minimizing the KL divergence between the variational posterior probability and the true posterior probability, the optimization problem in equation (5).

  27. Variational Inference (cont.) • We can expand the above equation • By extending it again, we can have (15)

  28. Variaitonal Multinomial • We first maximize Eq. (15) w.r.t. Φni, the probability that the n-th word is generated by latent topic i. • We form the Lagrangian by isolating the terms which contain Φni and adding the appropriate Lagrange multipliers. Let βiv be p(wvn=1|zi=1) for the appropriate v. (recall that each wn is a vector of size V with exactly one component equal to one; we can select the unique v such that wvn=1):

  29. Variaitonal Multinomial (cont.) • Taking derivatives w.r.t. Φni, we obtain: • Setting this to zero yields the maximizing value of the variational parameter Φni :

  30. Variational Dirichlet • Next we maximize equation (15) w.r.t. γi, the i-th component of the posterior Dirichlet parameters, the terms containing γi are: • By simplifying

  31. Variational Dirichlet (cont.) • Taking the derivative w.r.t. γi: • Setting this equation to zero yields a maximum at:

  32. Solve the Optimization Problem • Derivate the KL divergence and setting them equal to zero, we obtain the following update equations: where the expectation in the multinomial update can be computed as follows: where ψ is the first derivative of the logΓ function which is computable via Taylor approximations (Abramowitz and Stegun, 1970). (6) (7) (8)

  33. Computing E[log(θi|α)] • Recall that a distribution is in the exponential family if it can be written in the form: where η is the natural parameter, T(x) is the sufficient statistic, and A(η) is the log of the normalization factor. • As we can write the Dirichlet in this form by exponentiating the log of Eq.: p(θ|α)

  34. Computing E[log(θi|α)] (cont.) • From this form we see that the natural parameter of the Dirichlet is ηi=αi-1 and the sufficient statistic is T(θi)=logθi. Moreover, based on the general fact that the derivative of the log normalization factor w.r.t. the natural parameter is equal to the expectation of the sufficient statistic, we obtain: where ψ is the digamma function, the first derivative of the log Gamma function.

  35. Variational Inference Algorithm Each iteration requires O((N+1)k) operations For a single document the iteration number is on the order of the number of words in it Thus, the total number of operations roughly on the order of N2k

  36. Parameter Estimation • We can use a empirical Bayes method for parameter estimation. In particular, we wish to find parameters α and β that maximize the marginal log likelihood: • The quantity p(w|α, β) can be computed by the variational inference as described above. Thus, we can find approximate empirical Bayes estimates for the LDA model via an alternating variational EM procedure that maximizes a lower bound w.r.t. the variational parameters γ and Φ, and then fixed values of the variational parameters, maximizes the lower bound w.r.t. the model parameter α and β.

  37. Variational EM • (E-step) For each document, find the optimizing values of the variational parameters . This is done as described in the previous section. • (M-step) Maximize the resulting lower bound on the log likelihood w.r.t. the model parameters α and β. This corresponds to finding maximum likelihood estimates with expected sufficient statistics for each document under the approximate posterior which is computed in the E-step. Actually, the update for the conditional multinomial parameter β can be written out analytically: The update for αcan be implemented using an efficient Newton-Raphson method. These two steps are repeated until converges. (9)

  38. Parameter Estimation • We now consider how to obtain empirical Bayes estimates of the model parameters α and β. • We solve this problem by using the variational lower bound as a surrogate for the marginal log likelihood, with the variational parameters Φ and γ fixed to the values found by variational inference. • We then obtain empirical Bayes estimates by maximizing this lower bound w.r.t. the model parameters.

  39. Parameter Estimation (cont.) • Recall our approach for finding the empirical Bayes estimates is based on a variational EM procedure. • In the variational E-step, we maximize the bound w.r.t. the variational parameter γ and Φ. In the M-step, which we describe in this section, we maximize the bound w.r.t. the model parameters α and β. The overall procedure can thus be viewed as coordinate ascent in L.

  40. Conditional Multinomials • To maximize w.r.t. β, we isolate terms and add Lagrange multipliers: • Taking the derivative w.r.t. βijand set it to zero, we have

  41. Dirichlet • First, we have • Taking derivative w.r.t. αi, we obtain: • This derivative depends on αi, where j<>i, and we therefore must use an iterative method to find the maximal α. In particular, the Hessian is in the form found in equation (10):

  42. Dirichlet (cont.) • Finally, we can use the same algorithm to find an empirical Bayes point estimate of η, the scalar parameter for the exchangeable Dirichlet in the smoothed LDA model as mentioned above.

  43. Smoothing • Simple Laplace smoothing is no longer justified as a maximum a posteriori method in LDA setting. • We can then assume that each row in βkxV is independently drawn from an exchangeable Dirichlet distribution. That is to treat βi as random variables that are endowed with a posterior distribution, conditioned on the data.

  44. Smoothing Model • Thus we obtain a variational approach to Bayesian inference: where is the variational distribution defined for LDA as above and the update for the new variational parameter η is as follow:

  45. Applications

  46. Document Modeling • Perplexity is used to indicate the generalization performance of a method. • Specifically, we estimate a document modeling and use this model to describe the new data set. • LDA outperforms the other models including pLSI, Smoothed Unigram, and Smoothed Mixt. Unigrams.

  47. Document Classification • We can use the LDA model results as the features for classifiers. In this way, say 50 topics, we can reduce the feature space by 99.6%. • The experimental results show that such feature reduction may decrease the accuracy only a little.

  48. Collaborative Filtering • We can learn a model on a fully observed set of users. Then for each unobserved user, we are shown all but one of the movies preferred by that user and are asked to predict what the held-out movie is. • Precisely, define the predictive perplexity on M test uses as:

  49. Other Applications

  50. Object class decision Prior prob. of the object classes Image likelihood given the class The Naïve Bayes model c w N Csurka et al. 2004