Recognition: unknown
PolyChord: next-generation nested sampling
read the original abstract
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 such as those present in CosmoMC and CAMB, and is now in use in the CosmoChord and ModeChord codes. PolyChord is available for download at: http://ccpforge.cse.rl.ac.uk/gf/project/polychord/
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Cobaya: Code for Bayesian Analysis of hierarchical physical models
Cobaya is a modular Bayesian analysis code that exploits model interdependencies via automatic caching and a novel parameter-blocking algorithm to minimize sampling cost.
-
Saturation Mechanisms in the Interacting Dark Sector
Nonlinear dark-sector interaction models with a half-saturation sparseness scale are observationally preferred over their linear counterparts at >95% confidence for two of three cases.
-
Non-minimally coupled quintessence with sign-switching interaction
A new quintessence model with non-minimal coupling produces an effective sign-switching interaction that fits current data better than LambdaCDM or w0waCDM and accounts for late-time dark energy weakening without phan...
-
GetDist: a Python package for analysing Monte Carlo samples
GetDist implements boundary-corrected KDE with automatic smoothing for analyzing weighted and correlated Monte Carlo samples, plus plotting and diagnostic tools.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.