Algorithmic Variants of Nested Sampling

Nesting sampling is a methodology for computing the evidence (a high-dimensional integration of the likelihood over the prior density), and the posteriors simultaneously. Implementation in Julia of three algorithmic variants of nested sampling: Random Staggering, Slicing, and Random Slicing, are discussed in this work. Much of this work was inspired by the Python package, dynesty, and its modular approach to nested sampling which Julia’s multiple dispatch made even more effective.

This work was done as a part of Google Summer of Code 2020 with The Turing Team of The Julia Language Organisation. The code for this work is included in the Julia package NestedSamplers.jl and is inspired from the Python package dynesty. The slides for this presentation are available in this GitHub repository.

See also: Slides (426.9 KB)