Arrow Research search
Back to FOCS

FOCS 2012

Learning Topic Models - Going beyond SVD

Conference Paper Session 1A Algorithms and Complexity ยท Theoretical Computer Science

Abstract

Topic Modeling is an approach used for automatic comprehension and classification of data in a variety of settings, and perhaps the canonical application is in uncovering thematic structure in a corpus of documents. A number of foundational works both in machine learning and in theory have suggested a probabilistic model for documents, whereby documents arise as a convex combination of (i. e. distribution on) a small number of topic vectors, each topic vector being a distribution on words (i. e. a vector of word-frequencies). Similar models have since been used in a variety of application areas, the Latent Dirichlet Allocation or LDA model of Blei et al. is especially popular. Theoretical studies of topic modeling focus on learning the model's parameters assuming the data is actually generated from it. Existing approaches for the most part rely on Singular Value Decomposition (SVD), and consequently have one of two limitations: these works need to either assume that each document contains only one topic, or else can only recover the {\em span} of the topic vectors instead of the topic vectors themselves. This paper formally justifies Nonnegative Matrix Factorization (NMF) as a main tool in this context, which is an analog of SVD where all vectors are nonnegative. Using this tool we give the first polynomial-time algorithm for learning topic models without the above two limitations. The algorithm uses a fairly mild assumption about the underlying topic matrix called separability, which is usually found to hold in real-life data. Perhaps the most attractive feature of our algorithm is that it generalizes to yet more realistic models that incorporate topic-topic correlations, such as the Correlated Topic Model (CTM) and the Pachinko Allocation Model (PAM). We hope that this paper will motivate further theoretical results that use NMF as a replacement for SVD -- just as NMF has come to replace SVD in many applications.

Authors

Keywords

  • Vectors
  • Covariance matrix
  • Data models
  • Noise measurement
  • Computational modeling
  • Approximation methods
  • Dictionaries
  • Singular Value Decomposition
  • Topic Modeling
  • Machine Learning
  • Positive Matrix
  • Singular Value
  • Non-negative Matrix Factorization
  • Convex Combination
  • Latent Dirichlet Allocation
  • Allocation Model
  • Applications In Various Areas
  • Latent Dirichlet Allocation Model
  • Maximum Likelihood Estimation
  • Loss Of Generality
  • Identity Matrix
  • Diagonal Matrix
  • Newspaper Articles
  • Key Ingredient
  • Submatrix
  • Non-negative Factorization
  • Non-negative Matrix Factorization Algorithm
  • Dirichlet Distribution
  • Unknown Matrix
  • Dictionary Size
  • Gram Matrix
  • Words In The Lexicon

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
658126558116065055
v2026.09.13