A statistical test for nested sampling algorithms

From MaRDI portal
Publication:2631373

DOI10.1007/S11222-014-9512-YzbMATH Open1342.65021arXiv1407.5459OpenAlexW3106171379WikidataQ59754631 ScholiaQ59754631MaRDI QIDQ2631373FDOQ2631373


Authors: Johannes Buchner Edit this on Wikidata


Publication date: 29 July 2016

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: Nested sampling is an iterative integration procedure that shrinks the prior volume towards higher likelihoods by removing a "live" point at a time. A replacement point is drawn uniformly from the prior above an ever-increasing likelihood threshold. Thus, the problem of drawing from a space above a certain likelihood value arises naturally in nested sampling, making algorithms that solve this problem a key ingredient to the nested sampling framework. If the drawn points are distributed uniformly, the removal of a point shrinks the volume in a well-understood way, and the integration of nested sampling is unbiased. In this work, I develop a statistical test to check whether this is the case. This "Shrinkage Test" is useful to verify nested sampling algorithms in a controlled environment. I apply the shrinkage test to a test-problem, and show that some existing algorithms fail to pass it due to over-optimisation. I then demonstrate that a simple algorithm can be constructed which is robust against this type of problem. This RADFRIENDS algorithm is, however, inefficient in comparison to MULTINEST.


Full work available at URL: https://arxiv.org/abs/1407.5459




Recommendations




Cites Work


Cited In (9)

Uses Software





This page was built for publication: A statistical test for nested sampling algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631373)