























Abstract: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.
From: Topi Halme [view email]
[v1]
Wed, 3 Jun 2026 16:30:47 UTC (160 KB)
[v2]
Mon, 15 Jun 2026 14:02:55 UTC (164 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。