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

使用预测分布混合的自适应序列变化检测

Adaptive Sequential Change Detection using Mixtures of Predictive Distributions

Aalto University(阿尔托大学);Princeton University(普林斯顿大学)

Topi Halme, H. Vincent Poor, Visa Koivunen

AI总结:

针对后变化分布未知的独立观测序列变化检测问题,提出一种基于滑动窗口预测分布混合的PM-CuSum算法,实现一阶渐近最优性且渐近延迟余项更小。

摘要:

本文研究了当后变化分布未知时,检测独立观测序列分布变化的问题。我们提出了一种新颖的变化检测算法,称为预测混合CuSum(PM-CuSum),该算法在CuSum递归中结合了从不同长度滑动窗口构建的预测分布。预测分布根据其近期预测性能使用自适应权重进行聚合。我们证明,在温和条件下,PM-CuSum实现了一阶渐近最优性,并且其渐近延迟界具有比任何固定(甚至先知)窗口更小的余项阶数。数值模拟表明,与现有方法相比,PM-CuSum表现良好。此外,与插件似然相比,使用完整预测分布形成似然比可以显著提高性能。

英文摘要:

This paper studies the problem of detecting a change in the distribution of a sequence of independent observations when the post-change distribution is unknown. We propose a novel change detection algorithm, termed Predictive-Mixture CuSum (PM-CuSum), which combines predictive distributions constructed from sliding windows of different lengths within a CuSum recursion. The predictive distributions are aggregated using adaptive weights based on their recent predictive performance. We show that PM-CuSum achieves first-order asymptotic optimality under mild conditions, and that its asymptotic delay bound has a smaller remainder order than what is achieved procedures using a single fixed (even oracle) window. Numerical simulations demonstrate that PM-CuSum performs well compared to existing methods. Moreover, it is demonstrated that forming likelihood ratios using full predictive distributions can substantially improve performance compared to plug-in likelihoods.

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

↑