Nested sampling for frequentist computation: fast estimation of small p-values

05/27/2021 ∙ by Andrew Fowlie, et al. ∙ 0

We propose a novel method for computing p-values based on nested sampling (NS) applied to the sampling space rather than the parameter space of the problem, in contrast to its usage in Bayesian computation. The computational cost of NS scales as log^21/p, which compares favorably to the 1/p scaling for Monte Carlo (MC) simulations. For significances greater than about 4σ in both a toy problem and a simplified resonance search, we show that NS requires orders of magnitude fewer simulations than ordinary MC estimates. This is particularly relevant for high-energy physics, which adopts a 5σ gold standard for discovery. We conclude with remarks on new connections between Bayesian and frequentist computation and possibilities for tuning NS implementations for still better performance in this setting.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.