























Abstract:A fixed-confidence, finite-sample problem of active hypothesis testing arises in many safety-critical applications. Situated in the context of sequential hypothesis testing, this paper studies the effect of hypothesis elimination on the stopping time. We introduce an elimination-augmented Track-and-Stop algorithm, in which champion-specific active-opponent sets are progressively pruned, and sensing effort is reallocated toward the surviving alternatives. Our analysis derives a non-asymptotic upper bound on the expected stopping time. The gain in finite-sample from elimination appears on the scale of the non-leading term, resulting from tighter tracking and concentration constants on the reduced hypothesis set. Furthermore, we introduce an aggressiveness parameter to modulate the trade-off between faster elimination and weaker confidence guarantee. An experimental study on synthetic Gaussian instances confirms the theoretical predictions.
| Comments: | Submitted to IEEE Conference on Decision and Control (CDC) 2026. 18 pages, 4 figures |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.01039 [cs.LG] |
| (or arXiv:2605.01039v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.01039 arXiv-issued DOI via DataCite (pending registration) |
From: Ziyuan Lin [view email]
[v1]
Fri, 1 May 2026 19:08:12 UTC (532 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。