Diffusive nested sampling
- 975 Downloads
We introduce a general Monte Carlo method based on Nested Sampling (NS), for sampling complex probability distributions and estimating the normalising constant. The method uses one or more particles, which explore a mixture of nested probability distributions, each successive distribution occupying ∼e −1 times the enclosed prior mass of the previous distribution. While NS technically requires independent generation of particles, Markov Chain Monte Carlo (MCMC) exploration fits naturally into this technique. We illustrate the new method on a test problem and find that it can achieve four times the accuracy of classic MCMC-based Nested Sampling, for the same computational effort; equivalent to a factor of 16 speedup. An additional benefit is that more samples and a more accurate evidence value can be obtained simply by continuing the run for longer, as in standard MCMC.
KeywordsNested sampling Bayesian computation Markov chain Monte Carlo
- Feroz, F., Hobson, M.P., Bridges, M.: MultiNest: an efficient and robust Bayesian inference tool for cosmology and particle physics. arXiv:0809.3437 (2008)
- Murray, I.: Advances in Markov chain Monte Carlo methods. PhD thesis, Gatsby computational neuroscience unit, University College London (2007) Google Scholar
- Rosenthal, J.S.: Optimal proposal distributions and adaptive MCMC. In: Brooks, S.P., Gelman, A., Jones, G., Meng, X.-L. (eds.) Handbook of Markov Chain Monte Carlo. Chapman and Hall/CRC Press, Boca Raton (2010) Google Scholar
- Trias, M., Vecchio, A., Veitch, J.: Delayed rejection schemes for efficient Markov-chain Monte-Carlo sampling of multimodal distributions. arXiv:0904.2207 (2009)
Open AccessThis is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.