Elimination-augmented Track-and-Stop yields a non-asymptotic upper bound on stopping time in active hypothesis testing, with finite-sample improvements from tighter tracking on the reduced hypothesis set.
To pass from one chain to the whole correct- elimination event, it is therefore enough to sum over the disjoint chain events
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Finite-Sample Analysis of Elimination in Active Hypothesis Testing
Elimination-augmented Track-and-Stop yields a non-asymptotic upper bound on stopping time in active hypothesis testing, with finite-sample improvements from tighter tracking on the reduced hypothesis set.