-
Notifications
You must be signed in to change notification settings - Fork 33
New issue
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
Implement No-U-Turn Sampler (NUTS) #293
Comments
I know how to do this now as have implemented it elsewhere. Am adding to the paper project. |
I'm planning on implementing this. Based on discussions with Ben, it looks very difficult to fit in the ask-tell interface since it uses recursion. Seems like the simplest thing to do would be to write the original algorithm as a coroutine that yields whenever a likelihood evaluation is needed. Looks like the syntax of coroutines is currently in flux (https://docs.python.org/3/library/asyncio-task.html). The old generator based syntax (using the Also, @ben18785: should I be implementing the nuts in this issue or in #1001? As an aside, I'm impressed that googling "pints nuts" leads me to #1001, I think it was about 5th in the list :) |
Awesome! Thanks for picking this up @martinjrobins I might be OK with at least one method not being ask-and-tell, if it really doesn't fit? Not sure about Python 2.7. I imagine some academic users will be stuck with 2.7 for a while, so I'd like to keep it compatible for a while. At the very least, even if we don't test, I'd like 2.7 to be able to |
I need at least the |
Yeah I'm happy with a solution like that :-) E.g., in the init
then further down
and in the tests:
|
This is actually the algorithm (not HMC, although they are similar) that powers Stan and Pymc3. Look at the latest papers on Stan/Pymc3 to see what variants they implement.
The text was updated successfully, but these errors were encountered: