30 April 2024 to 3 May 2024
Amsterdam, Hotel CASA
Europe/Amsterdam timezone

Clustering Considerations for Nested Sampling

30 Apr 2024, 15:45
3m
Sorbonne, Hotel CASA

Sorbonne, Hotel CASA

Flashtalk with Poster Session A 2.3 Simulation-based inference

Speaker

Adam Ormondroyd (University of Cambridge)

Description

PolyChord was originally advertised encouraging users to experiment with their own clustering algorithms. Identifying clusters of nested sampling live points is critical for PolyChord to perform nested sampling correctly. We have updated the Python interface of PolyChordLite to allow straightforward substitution of different clustering methods.

Recent reconstructions of the primordial matter power spectrum $\mathcal P_\mathcal R(k)$ with a flex-knot revealed that the K-Nearest-Neighbours algorithm used by PolyChord cannot reliably detect the two posterior modes caused by cosmic variance and detector resolution. After exploring a number of different algorithms, we have found the X-means algorithm to be a reliable substitute for the power spectrum reconstruction.

This work prompted the development of additions fo the post-processing tool anesthetic, allowing posterior modes corresponding to different live pint clusters to be analysed and plotted independently.

Primary author

Adam Ormondroyd (University of Cambridge)

Co-authors

Anthony Lasenby (University of Cambridge) Mike Hobson (University of Cambridge) Will Handley (University Of Cambridge)

Presentation materials