A provable SVD-based algorithm for learning topics in dominant admixture corpus

Trapit Bansal, Chiranjib Bhattacharyya, Ravindran Kannan.
Neural Information Processing Systems (NIPS), 2014.

Download Paper
Download Supplementary

Abstract

Topic models, such as Latent Dirichlet Allocation (LDA), posit that documents are drawn from admixtures of distributions over words, known as topics. The inference problem of recovering topics from such a collection of documents drawn from admixtures, is NP-hard. Making a strong assumption called separability, Arora et. al. (2012) gave the first provable algorithm for inference. For the widely used LDA model, Anandkumar et. al. (2012) gave a provable algorithm using clever tensor-methods. But Arora et. al. (2012) and Anandkumar et. al. (2012) do not learn topic vectors with bounded l_1 error (a natural measure for probability vectors).
Our aim is to develop a model which makes intuitive and empirically supported assumptions and to design an algorithm with natural, simple components such as SVD, which provably solves the inference problem for the model with bounded l_1 error. A topic in LDA and other models is essentially characterized by a group of co-occurring words. Motivated by this, we introduce topic specific Catchwords, a group of words which occur with strictly greater frequency in a topic than any other topic individually and are required to have high frequency together rather than individually. A major contribution of the paper is to show that under this more realistic assumption, which is empirically verified on real corpora, a singular value decomposition (SVD) based algorithm with a crucial pre-processing step of thresholding, can provably recover the topics from a collection of documents drawn from Dominant admixtures. Dominant admixtures are convex combination of distributions in which one distribution has a significantly higher contribution than the others. Apart from the simplicity of the algorithm, the sample complexity has near optimal dependence on w_0, the lowest probability that a topic is dominant, and is better than Arora et. al. (2012). Empirical evidence shows that on several real world corpora, both Catchwords and Dominant admixture assumptions hold and the proposed algorithm substantially outperforms the state of the art Arora et. al. (2013).

Code

Matlab Code is available. Download or Fork on Git Hub
Refer to ReadMe.txt for information on using the code.
For any bugs, queries, suggestions or thanks, drop a line to “trapitbansal at gmail dot com”

Contact

Please feel free to contact the authors for any queries, comments etc.
If you have any thoughts or criticism on this work, we will be happy to discuss.