Open hucheng opened 9 years ago
F+ tree (see paper http://www.cs.utexas.edu/~rofuyu/papers/nomad-lda-www.pdf) can get more fresh state than aliasTable, and with lower initialization cost (log(k)), but with higher sample cost (log(k)).
This is good for LDA model inference?
We've already implement F+ tree, but not tested yet.
F+ tree (see paper http://www.cs.utexas.edu/~rofuyu/papers/nomad-lda-www.pdf) can get more fresh state than aliasTable, and with lower initialization cost (log(k)), but with higher sample cost (log(k)).
This is good for LDA model inference?