Finding an Upper Limit in the Presence of Unknown Background
S. Yellin
TL;DR
The paper addresses setting upper limits on a signal when an unknown background cannot be reliably subtracted. It introduces two interval-based, unbinned methods—the Maximum Gap method and the Optimum Interval method—that yield true frequentist one-sided confidence intervals and are robust to unknown background distributions. By deriving the key statistic $C_0(x,\mu)$ for the maximum-gap case and extending to $C_n(x,\mu)$ and $C_{\mathrm{Max}}$ for the optimum-interval approach, the authors show these methods outperform conventional Poisson-based limits in low-count, background-uncertainty scenarios. The optimum interval method with $C_{\mathrm{Max}}$ provides the strongest, most reliable upper limits, is insensitive to binning and cut choices, and is suitable for rare-event searches such as WIMP experiments, with practical software support available.
Abstract
Experimenters report an upper limit if the signal they are trying to detect is non-existent or below their experiment's sensitivity. Such experiments may be contaminated with a background too poorly understood to subtract. If the background is distributed differently in some parameter from the expected signal, it is possible to take advantage of this difference to get a stronger limit than would be possible if the difference in distribution were ignored. We discuss the ``Maximum Gap'' method, which finds the best gap between events for setting an upper limit, and generalize to ``Optimum Interval'' methods, which use intervals with especially few events. These methods, which apply to the case of relatively small backgrounds, do not use binning, are relatively insensitive to cuts on the range of the parameter, are parameter independent (i.e., do not change when a one-one change of variables is made), and provide true, though possibly conservative, classical one-sided confidence intervals.
