On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds
The episode discusses a paper by Agrawal and Ramdas on stopping times for power-one sequential tests. The hosts explore lower and upper bounds for sample size needed in two regimes: when error probability is tiny, and when the alternative is close to the null. They highlight the generality of these bounds and the technical contributions, such as modified KLinf functions.