Update on the parallel IMH article
The article advocates the use of parallel computation and the method described, called “block IMH”, can be done fully in parallel, which makes the whole thing pretty much costless compared to standard Independent Metropolis-Hastings, while significantly decreasing the variance of any estimator based on the generated Markov Chain.
Just a quick update: since then, the reviewers from JCGS got back to us with useful comments and we made a second version, available on arXiv as well. It’s hopefully clearer and the graphs are more compact and informative (thank you, my dear dear ggplot2 package).
Also I’ve put the code online on Google Code:
It’s not a very user-friendly package, still it allows to reproduce the graphs shown in the article and would perhaps help people who want to try the method out!