Topic Discovery through Data Dependent and Random Projections


Weicong Ding, Mohammad Hossein Rohban, Prakash Ishwar, Venkatesh Saligrama ;
Proceedings of the 30th International Conference on Machine Learning, PMLR 28(3):1202-1210, 2013.


We present algorithms for topic modeling based on the geometry of cross-document word-frequency patterns. This perspective gains significance under the so called separability condition. This is a condition on existence of novel-words that are unique to each topic. We present a suite of highly efficient algorithms with provable guarantees based on data-dependent and random projections to identify novel words and associated topics. Our key insight here is that the maximum and minimum values of cross-document frequency patterns projected along any direction are associated with novel words. While our sample complexity bounds for topic recovery are similar to the state-of-art, the computational complexity of our random projection scheme scales linearly with the number of documents and the number of words per document. We present several experiments on synthetic and realworld datasets to demonstrate qualitative and quantitative merits of our scheme.

Related Material