Necessary and Sufficient Conditions and a Provably Efficient Algorithm for Separable Topic Discovery
arXiv: Learning, Volume abs/1508.05565, 2015.
EI
Abstract:
We develop necessary and sufficient conditions and a novel provably consistent and efficient algorithm for discovering topics (latent factors) from observations (documents) that are realized from a probabilistic mixture of shared latent factors that have certain properties. Our focus is on the class of topic models in which each shared la...More
Code:
Data:
Tags
Comments