polychord: next-generation nested sampling

  title={polychord: next-generation nested sampling},
  author={Will Handley and M. P. Hobson and Anthony N. Lasenby},
  journal={Monthly Notices of the Royal Astronomical Society},
PolyChord is a novel nested sampling algorithm tailored for high-dimensional parameter spaces. This paper coincides with the release of PolyChord v1.3, and provides an extensive account of the algorithm. PolyChord utilises slice sampling at each iteration to sample within the hard likelihood constraint of nested sampling. It can identify and evolve separate modes of a posterior semi-independently, and is parallelised using openMPI. It is capable of exploiting a hierarchy of parameter speeds… 
dyPolyChord: dynamic nested sampling with PolyChord
Nested sampling performs well compared to Markov chain Monte Carlo (MCMC)-based alternatives at exploring multimodal and degenerate distributions, and the PolyChord software is well-suited to high-dimensional problems.
Nested Sampling Methods
A new formulation of NS is presented, which casts the parameter space exploration as a search on a tree and ways of obtaining robust error estimates and dynamic variations of the number of live points are presented as special cases of this formulation.
Importance Nested Sampling and the MultiNest Algorithm
Bayesian inference involves two main computational challenges. First, in estimating the parameters of some model for the data, the posterior distribution may well be highly multi-modal: a regime in
nestcheck: diagnostic tests for nested sampling calculations
New diagnostic tests to assess the reliability both of parameter estimation and evidence calculations using nested sampling software, and demonstrates them empirically.
Nested sampling with normalizing flows for gravitational-wave inference
We present a novel method for sampling iso-likelihood contours in nested sampling using a type of machine learning algorithm known as normalising flows and incorporate it into our sampler Nessai.
Geometric nested sampling: sampling from distributions defined on non-trivial geometries
  • K. Javid
  • Computer Science
    J. Open Source Softw.
  • 2020
The geometric nested sampling algorithm I present here is based on the Metropolis Hastings method, but treats parameters as though they represent points on certain geometric objects, namely circles, tori and spheres.
Diagnostic Tests for Nested Sampling Calculations
New diagnostic tests to assess the reliability of both parameter estimation and evidence calculations using nested sampling software, and are implemented in nestcheck: a publicly available python package for analysing nested sampling calculations which is compatible with results from MultiNest and PolyChord.
Simulation-efficient marginal posterior estimation with swyft: stop wasting your precious time
This work presents algorithms for nested neural likelihood-to-evidence ratio estimation and simulation reuse via an inhomogeneous Poisson point process cache of parameters and corresponding simulations that enable automatic and extremely simulator efficient estimation of marginal and joint posteriors.
Cobaya: code for Bayesian analysis of hierarchical physical models
Cobaya is a general-purpose Bayesian analysis code aimed at models with complex internal interdependencies, and includes interfaces to a set of cosmological Boltzmann codes and likelihoods, and automatic installers for external dependencies.


polychord: nested sampling for cosmology
PolyChord is a novel nested sampling algorithm tailored for high dimensional parameter spaces that utilises slice sampling at each iteration to sample within the hard likelihood constraint of nested sampling.
Diffusive nested sampling
A general Monte Carlo method based on Nested Sampling, for sampling complex probability distributions and estimating the normalising constant is introduced, and it is found that it can achieve four times the accuracy of classic MCMC-based Nests Sampling.
Nested sampling for general Bayesian computation
Nested sampling estimates directly how the likelihood function relates to prior mass. The evidence (alternatively the marginal likelihood, marginal den- sity of the data, or the prior predictive) is
Multimodal nested sampling: an efficient and robust alternative to Markov Chain Monte Carlo methods for astronomical data analyses
Three new methods for sampling and evidence evaluation from distributions that may contain multiple modes and significant degeneracies in very high dimensions are presented, leading to a further substantial improvement in sampling efficiency and robustness and an even more efficient technique for estimating the uncertainty on the evaluated evidence.
MultiNest: an efficient and robust Bayesian inference tool for cosmology and particle physics
The developments presented here lead to further improvements in sampling efficiency and robustness, as compared to the original algorit hm presented in Feroz & Hobson (2008), which itself significantly outperformed existi ng MCMC techniques in a wide range of astrophysical inference problems.
Invited comment on the paper "Slice Sampling" by Radford Neal
Markov chain sampling methods that adapt to characteristics of the distribution being sampled can be constructed using the principle that one can ample from a distribution by sampling uniformly from
A Nested sampling algorithm for cosmological model selection
The abundance of new cosmological data becoming available means that a wider range of cosmological models are testable than ever before. However, an important distinction must be made between
Bayesian Analysis of Inflation III: Slow Roll Reconstruction Using Model Selection
We implement Slow Roll Reconstruction – an optimal solution to the inverse problem for inflationary cosmology – within ModeCode, a publicly available solver for the inflationary dynamics. We obtain
On statistical uncertainty in nested sampling
The uncertainty estimator from Skilling is examined and a new estimator based on a detailed analysis of the statistical properties of nested sampling is introduced, making it possible to obtain the statistical uncertainty in the evidence with no additional computational cost.
Efficient sampling of fast and slow cosmological parameters
This work describes a method for decorrelating fast and slow parameters so that parameter sampling in the full space becomes almost as efficient as sampled in the slow subspace when the covariance is well known and the distributions are simple.