Eisenstein et al 2011: Sparse Additive Generative Models of Text

From Cohen Courses
Revision as of 21:55, 28 November 2011 by Yww (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search


Sparse Additive Generative Models of Text. Eisenstein, Ahmed and Xing. Proceedings of ICML 2011.

Online version

Eisenstein et al 2011


This recent paper presents sparse learning and additive generative modeling approaches for Topic modeling. This is an important alternative approach to Latent Dirichlet Allocation (LDA) where sparsity and log-space additive modeling are NOT considered or introduced.

Brief Description of the method

This paper first describes three big disadvantages of Latent Dirichlet Allocation: high inference cost, overparameterization, and lack of sparsity representation. Then, it introduces SAGE, an additive generative model which does not require learning the same background distribution again and again, but rather introduces a sparse topic model that performs addition in log-space.

The Generative Story

In contrast to traditional multinomial modeling of words in LDA, SAGE looks at log frequencies and the generative distribution of words in a document d is

where is the background and is the log frequency deviation that represents topic. By doing this, the authors argue that SAGE can take advantages of sparsity-inducing priors on to obtain additional robustness for the model. The generative story of SAGE can be described as follows

  • Draw background distribution m from an uninformative prior
  • For each class k:
     -- For each term i      
          1. Draw 
          2. Draw 
     -- Set 
  • For each document d:
     -- Draw a class  from uniform distribution
     -- For each word n, draw 

Here, indicates the exponential distribution. If we fit a variational distribution over the latent variables, optimizing the bound, we can get the following likelihood equation

Then, we can perform Newton methods to solve the above optimization problem.

Parameter Estimation

For the component vector , the authors use the Sherman-Morrison formula to derive the Hessian matrix H, then gradient can be computed. When considering the variance, the authors construct a fully-factored variational distribution .

Dataset and Experiment Settings

The authors perform four experiments on different datasets.

Experimental Results

The authors performed four major experiments. The first experiment does not include latent variables. The second experiment explores sparse topic models with latent variables. The last two experiments are related to multifaceted generative models.

Exp 1: Document classification


SAGE outperforms multinomial in all settings. Notably, the gap between SAGE and multinomial was wider when the training data was sparse.

Exp 2: Sparse topic models


In the above figure 3, with both 25 and 50 topics, SAGE outperforms Dirichlet allocation. When increasing the number of topics, non-zero weights decreased 5-fold. In figure 4, it shows that SAGE admits very little topical variation for low frequency words, where in contrasts, LDA displays little sensitivity to overall term frequency.

Exp 3: Topic and ideology


The SAGE model achieved 69.6% accuracy when K = 30, outperforming Ahmed and Xing (2010).

Exp 4: Geolocation from text


When predicting geolocation from Twitter data, SAGE obtained the best mean error in kilometers.

Some Reflections

(1) It is very interesting to see additive generative model (log-space) for topic modeling.

(2) The sparsity is not only for robustness, but also for efficiency in parameter estimation.

(3) Additive models allow plug-ins of different components without much effort.

Related Papers

This paper is related to many papers in topic modeling, inference algorithms in graphical models and unsupervised learning.

(1) Topic modeling.

(2) Inference algorithms in graphical models.

(3) Unsupervised learning.