A Practical Algorithm for Topic Modeling with Provable Guarantees
Sanjeev Arora, Ge, Rong, Yoni Halpern et al. · arXiv (Cornell University) · 2012
Topic models provide a useful method for dimensionality reduction and exploratory data analysis in large text corpora. Most approaches to topic model inference have been based on a maximum likelihood objective. Efficient algorithms exist that approximate this objective, but they have no provable guarantees. Recently, algorithms have been introduced that provide provable bounds, but these algorithms are not practical because they are inefficient and not robust to violations of model assumptions. In this paper we present an algorithm for topic model inference that is both provable and practical. The algorithm produces results comparable to the best MCMC implementations while running orders of magnitude faster.
Cited by 161 works. doi:10.48550/arxiv.1212.4777 Open-access PDF
Authors
References
- Indexing by latent semantic analysis
- Latent dirichlet allocation
- Numerical optimization
- Exponentiated Gradient versus Gradient Descent for Linear Predictors
- A correlated topic model of Science
- Evaluation methods for topic models
- Perturbation bounds in connection with singular value decomposition
- Optimizing Semantic Coherence in Topic Models
- Efficient methods for topic model inference on streaming document collections
- Pachinko allocation: dag-structured mixture models of topic correlations