Non-negative matrix factorization algorithms greatly improve topic model fits

📅 2021-05-27
🏛️ arXiv.org
📈 Citations: 26
Influential: 1
📄 PDF

career value

216K/year
🤖 AI Summary
Traditional topic models impose a “sum-to-one” constraint on parameters, leading to complex optimization landscapes and low computational efficiency. This work proposes integrating nonnegative matrix factorization (NMF) into topic model parameter estimation, eliminating the hard simplex constraint and instead leveraging NMF’s nonnegativity and low-rank structure to implicitly model topic distributions—thereby substantially simplifying the optimization problem. Methodologically, we design an efficient solving framework built upon state-of-the-art NMF algorithms and incorporate a post-processing step to recover interpretable probabilistic parameters; the method is implemented in the R package *fastTopics*. Experiments demonstrate consistent improvements in both accuracy and speed under maximum likelihood estimation and variational inference: superior fit within fixed time budgets, or significantly reduced runtime at equivalent accuracy. To our knowledge, this is the first systematic integration of NMF’s optimization advantages across the entire topic modeling pipeline, offering a new paradigm for high-dimensional text modeling that balances theoretical simplicity with computational scalability.
📝 Abstract
We report on the potential for using algorithms for non-negative matrix factorization (NMF) to improve parameter estimation in topic models. While several papers have studied connections between NMF and topic models, none have suggested leveraging these connections to develop new algorithms for fitting topic models. NMF avoids the"sum-to-one"constraints on the topic model parameters, resulting in an optimization problem with simpler structure and more efficient computations. Building on recent advances in optimization algorithms for NMF, we show that first solving the NMF problem then recovering the topic model fit can produce remarkably better fits, and in less time, than standard algorithms for topic models. While we focus primarily on maximum likelihood estimation, we show that this approach also has the potential to improve variational inference for topic models. Our methods are implemented in the R package fastTopics.
Problem

Research questions and friction points this paper is trying to address.

Improving topic model fits using NMF algorithms
Avoiding sum-to-one constraints for efficient computations
Enhancing both MLE and variational inference in topic models
Innovation

Methods, ideas, or system contributions that make the work stand out.

NMF improves topic model parameter estimation
NMF avoids sum-to-one constraints for efficiency
NMF enhances both speed and model fit
🔎 Similar Papers
No similar papers found.
P
P. Carbonetto
Department of Human Genetics, University of Chicago, Chicago, IL, 60637
A
Abhishek K. Sarkar
Department of Human Genetics, University of Chicago, Chicago, IL, 60637 and Vesalius Therapeutics, Cambridge, MA, 02142
Z
Zihao Wang
Department of Statistics, University of Chicago, Chicago, IL, 60637
M
M. Stephens
Departments of Statistics and Human Genetics, University of Chicago, Chicago, IL, 60637