Graph explorer

Diffusive Nested Sampling

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.

7 nodes6 linksoverview mapDiffusive Nested Sampling
7 nodes6 links
Diffusive Nested Sampling7 visible / 7 total nodes / 9 links
Co-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipTopic signalTopic signalTopic signalWDiffusive Nested Samplingpreprint / 2010ABrendon J. BrewerResearcherALivia B. PártayResearcherAGábor CsányiResearcherTastro-ph.IM4506 worksTphysics.data-an1229 worksTComputation1468 works
PaperSignal 106 links

Diffusive Nested Sampling

preprint / 2010

Open