arXiv Machine Learning By Shubhada Agrawal, Ashwin Ram, Aaditya Ramdas

On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds

Read the original on arXiv Machine Learning →

arXiv:2504. 19952v2 Announce Type: replace-cross Abstract: We present two general lower bounds for stopping times of sequential tests between arbitrary composite nulls $\mathcal P$ and alternatives $\mathcal Q$.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 5

Multi-Armed Sequential Hypothesis Testing by Betting

arXiv:2603. 17925v2 Announce Type: replace-cross Abstract: We consider a variant of sequential testing by betting where, at each time step, the statistician is presented with multiple data sources (arms) and obtains data by choosing one of the arms.

By Ricardo J. Sandoval, Ian Waudby-Smith, Michael I. Jordan