有限样本下消除在主动假设检验中的分析
Finite-Sample Analysis of Elimination in Active Hypothesis Testing
AI总结:
本文研究了主动假设检验中消除对停止时间的影响,提出消除增强的Track-and-Stop算法,通过逐步修剪候选集并重新分配传感努力,推导出非渐近的停止时间上界,并引入 aggressiveness 参数调节消除速度与置信度的权衡。
摘要:
在许多安全关键应用中,固定置信度的有限样本主动假设检验问题出现。本文在序列假设检验背景下研究假设消除对停止时间的影响。我们引入了消除增强的Track-and-Stop算法,其中针对每个冠军的主动对手集逐步被修剪,并将传感努力重新分配给存活的替代方案。我们的分析推导出预期停止时间的非渐近上界。消除在有限样本中的收益出现在非主导项的尺度上,源于在减少的假设集上更紧的跟踪和集中常数。此外,我们引入了一个aggressiveness参数来调节消除速度与置信度保证之间的权衡。在合成高斯实例上的实验研究证实了理论预测。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。