Sensitivity of searches for new signals and its optimization
Giovanni Punzi
Abstract
A frequentist definition of sensitivity of a search for new phenomena is discussed, that has several useful properties. It is based on completely standard concepts, is generally applicable, and has a very clear interpretation. It is particularly suitable for optimization, being independent of a-priori expectations about the presence of a signal, thus allowing the determination of a single set of cuts that is optimal both for setting limits and for making a discovery. Simple approximate formulas are given for the common problem of Poisson counts with background.
Create a lesson
Related papers
Reduced latent leakage does not reliably predict lower likelihood bias in collider inference
Tong Pan
The Greedy Bump Bias: Local Profiling Geometry and the Look-Elsewhere Effect
Tommaso Dorigo
Multi-fidelity Monte Carlo estimation of floor response spectra under combined seismic and structural parameter uncertainties
Nils Baillie, Baptiste Kerleguer, Cyril Feau et al.
Parameter inference from a non-stationary unknown process using statistical feature-based slow feature analysis
Kieran S. Owens, Masako Tamaki, Ben D. Fulcher
A Probability Model for Pentagonal Prism Dice Rolls
Paul R. Hurst, J. Naleo Hyde
Geometry-native machine learning reconstruction of DSMC moment fields with support monitoring
Ehsan Roohi