Performance of Test Supermartingale Confidence Intervals for the Success Probability of Bernoulli Trials

Given a composite null hypothesis $$, test supermartingales are non-negative supermartingales with respect to $$ with an initial value of $$. Large values of test supermartingales provide evidence against $$. As a result, test supermartingales are an effective tool for rejecting $$, particularly when the $$-values obtained are very small and serve as certificates against the null hypothesis. Examples include the rejection of local realism as an explanation of Bell test experiments in the foundations of physics and the certification of entanglement in quantum information science. Test supermartingales have the advantage of being adaptable during an experiment and allowing for arbitrary stopping rules. By inversion of acceptance regions, they can also be used to determine confidence sets. We used an example to compare the performance of test supermartingales for computing $$-values and confidence intervals to Chernoff-Hoeffding bounds and the "exact" $$-value. The example is the problem of inferring the probability of success in a sequence of Bernoulli trials. There is a cost in using a technique that has no restriction on stopping rules, and, for a particular test supermartingale, our study quantifies this cost.