9–11 Jul 2024
Kraków
Europe/Warsaw timezone

PolySwyft: a sequential simulation-based nested sampler

10 Jul 2024, 17:15
25m
Kraków

Kraków

ul. Łojasiewicza 11

Speaker

Will Handley (University of Cambridge)

Description

We present recent advances in combining Nested Sampling and Simulation Based Inference, and show these are performant for cosmological scale problems. Nested sampling [1,2] is a numerical Bayesian inference tool for performing model comparison and parameter estimation, and has been widely applied across cosmology & particle physics. Simulation based inference (SBI) is an emerging new paradigm for data analysis [3], which allows researchers to perform inference tasks such as parameter estimation, model comparison, and hypothesis testing directly from forward simulations without the need for an explicit likelihood function, and has already had successful application in weak lensing [4] and 21cm cosmology [5]. By removing the need for an explicit likelihood, SBI frees us from assumptions such as fiducial cosmological model (typically ΛCDM) and comprises a next-generation tool for disentangling tensions from systematics.

At its heart, the nested sampling meta-algorithm requires sampling from the prior subject to a hard likelihood constraint. It is therefore challenging to apply nested sampling if the likelihood is not explicitly available, as is the case in simulation based inference. To address this, we propose a sequential algorithm which iteratively runs nested sampling on a ratio estimator whose training data are progressively informed by the dead points of the previous nested sampling runs. This replaces truncation with nested sampling's dead measure, and allows training of neural ratio estimators without marginalisation for generative models with around 10 free parameters without marginalisation.

As an example of this synthesis, we use PolyChord [6] for nested sampling and swyft [7] for the neural ratio estimator (forming PolySwyft), but emphasise the generality of this approach throughout. We showcase it on CMB and 21cm toy examples, and discuss potential future extensions to higher numbers of parameters and a deeper integration of the two algorithms.

[1] https://arxiv.org/abs/2205.15570
[2] https://arxiv.org/abs/2101.09675
[3] https://arxiv.org/abs/1911.01429
[4] https://arxiv.org/abs/2403.02314
[5] https://arxiv.org/abs/2403.14618
[6] https://github.com/PolyChord/PolyChordLite
[7] https://swyft.readthedocs.io/en/stable/
[Paper to be released at around the time of the talk]

Primary authors

Prof. Christoph Weniger (GRAPPA) Mr Kilian Scheutwinkel (University of Cambridge) Will Handley (University of Cambridge)

Presentation materials