dynesty: a dynamic nested sampling package for estimating Bayesian posteriors and evidences

By Joshua S. Speagle. Monthly notices of the Royal Astronomical Society, 2019

1,647 citations recorded by the source corpus.

We present dynesty, a public, open-source, python package to estimate Bayesian posteriors and evidences (marginal likelihoods) using the dynamic nested sampling methods developed by Higson et al. By adaptively allocating samples based on posterior structure, dynamic nested sampling has the benefits of Markov chain Monte Carlo (MCMC) algorithms that focus exclusively on posterior estimation while retaining nested sampling’s ability to estimate evidences and sample from complex, multimodal distributions. We provide an overview of nested sampling, its extension to dynamic nested sampling, the algorithmic challenges involved, and the various approaches taken to solve them in this and previous work. We then examine dynesty’s performance on a variety of toy problems along with several astronomical applications. We find in particular problems dynesty can provide substantial improvements in sampling efficiency compared to popular MCMC approaches in the astronomical literature. More detailed statistical results related to nested sampling are also included in the appendix.

Subfields: Artificial Intelligence, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/4c9c19f5d1425a5b43382a93beef638263958b84

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. C. Conroy
  2. Maya Fishbach
  3. C. Berry
  4. Benjamin D. Johnson
  5. J. Leja
  6. Simon Stevenson
  7. D. Holz
  8. K. Chatziioannou

In Statistics and Probability

  1. C. Conroy
  2. J. Leja
  3. Benjamin D. Johnson
  4. S. Tacchella
  5. P. Oesch
  6. S. Bose
  7. R. Naidu
  8. C. Mason

Citations in the corpus