WarpLDA: a Cache Efficient O(1) Algorithm for Latent Dirichlet Allocation

29 Oct 2015Jianfei ChenKaiwei LiJun ZhuWenguang Chen

Developing efficient and scalable algorithms for Latent Dirichlet Allocation (LDA) is of wide interest for many applications. Previous work has developed an O(1) Metropolis-Hastings sampling method for each token... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.