arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.00693math.STstat.TH
收藏

使用 min-CuSum 的序贯变化诊断中的最坏情况错误识别控制

Worst-Case Misidentification Control in Sequential Change Diagnosis using the min-CuSum

Austin Warner, Georgios Fellouris

AI总结:

针对单信道突变的序贯变化诊断问题,论文分析 min-CuSum 算法,证明其最坏情况错误识别概率随阈值指数衰减,并在误报与错误识别约束下渐近最小化 Lorden 检测延迟。

摘要:

本文考虑序贯变化诊断问题,其中可按顺序访问一列独立随机元素,其分布会在某个未知时刻发生突变,并且存在两个主要运行目标:快速检测该变化,并在停止时从有限个备选分布中准确识别变化后分布。文中研究了这样一种算法:一旦对应于某个变化后备选分布的 CuSum 统计量超过某个阈值,便发出警报。当数据通过多个独立信道生成,且变化只能发生在其中一个信道中时,研究表明:在未发生误报的条件下,其相对于变化点的最坏情况错误识别条件概率,会随阈值呈指数快速衰减。作为推论,在该设置下,当前者(误报率)比后者(最坏情况错误识别条件概率)足够快地趋于零时,在满足误报率和最坏情况错误识别条件概率的规定界的方案类别中,该算法被证明可针对每一种可能的变化后分布,同时渐近最小化 Lorden 检测延迟准则。最后,仿真研究也阐明了这些理论结果。

英文摘要:

The problem of sequential change diagnosis is considered, where a sequence of independent random elements is accessed sequentially, there is an abrupt change in its distribution at some unknown time, and there are two main operational goals: to quickly detect the change and, upon stopping, to accurately identify the post-change distribution among a finite set of alternatives. The algorithm that raises an alarm as soon as the CuSum statistic that corresponds to one of the post-change alternatives exceeds a certain threshold is studied. When the data are generated over independent channels and the change can occur in only one of them, its worst-case with respect to the change point conditional probability of misidentification, given that there was not a false alarm, is shown to decay exponentially fast in the threshold. As a corollary, in this setup, this algorithm is shown to asymptotically minimize Lorden's detection delay criterion, simultaneously for every possible post-change distribution, within the class of schemes that satisfy prescribed bounds on the false alarm rate and the worst-case conditional probability of misidentification, as the former goes to zero sufficiently faster than the latter. Finally, these theoretical results are also illustrated in simulation studies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑