We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
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?
The text was updated successfully, but these errors were encountered:
We've already implement F+ tree, but not tested yet.
Sorry, something went wrong.
No branches or pull requests
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?
The text was updated successfully, but these errors were encountered: