en
0.25
0.5
0.75
1.25
1.5
1.75
2
Complexity of Inference in Latent Dirichlet Allocation
Published on 2012-09-063449 Views
We consider the computational complexity of probabilistic inference in Latent Dirichlet Allocation (LDA). First, we study the problem of finding the maximum a posteriori (MAP) assignment of topics to
Related categories
Presentation
Complexity of Inference in Latent Dirichlet Alloca6on00:00
We study the complexity of probabilis6c inference in Latent Dirichlet Alloca6on01:07
Main Results03:04