-
Notifications
You must be signed in to change notification settings - Fork 5
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
Non-reversible parallel tempering and optimal ladders #130
Comments
This sounds great, I had not actually seen the 2021 Syed paper, and I just finished implementing adaptation based on the Adaptive Parallel Tempering Algorithm from Miasojedow in 2013, I would be more than happy to talk and collaborate on this. Can you drop me an email at [email protected] ? |
Came here to suggest this. The Syed 2019 paper is great! |
@sethaxen I set it up to use a separate step size and mass matrix for each tempering level. Using a global adaptation would probably increase the communication overhead and we wanted to limit this since our use case usually involves distributed computing. Looking forward to working with everyone! |
Good stuff, have emailed out to everyone to try and organise a meeting |
Have you written anything on how to use the adaptive tempering in MCMCTempering? When I went through the readme it only mentioned a way to call it with a specified number of steps, and didn't mention anything about adaptive tempering. |
Hi All, |
I see that the pull request has implemented a bunch of these features, so I guess I will step back. Great to see that people are interested in the method! |
Actually, I don't think any of these methods have been implemented yet. We'd definitely love some help with getting them up and running! |
Sounds good! It will take me some time to get familiar with the existing code, but I am looking forward to contributing. |
Hi,
This package looks great. I wonder if you have considered using the adaptation schemes from Syed 2019 and Syed 2021.
I have implemented the first of those parallel tempering schemes in C++ and interfaced it with Stan to do some high-dimensional sampling for the EHT and found orders of magnitude improvements over other adaptation schemes. There are also many improvements in the second reference that should drastically increase the round-trip rate of the sampler.
@s-syed and I were actually planning on implementing a generic parallel tempering algorithm for Julia, but it looks like you have a great package here. Did you want to join forces? Having a state-of-the-art PT package in Julia that works with most of AbstractMCMC.jl would be pretty cool.
The text was updated successfully, but these errors were encountered: