非规范化统计模型的最快变化检测
Quickest Change Detection for Unnormalized Statistical Models
摘要:
经典的最快变化检测算法需要对变化前和变化后的分布进行建模。由于计算显式分布的复杂性,这种方法对于各种机器学习模型可能不可行。另外,这些方法可能遭受缺乏对模型失配和噪声的鲁棒性。本文提出了一种新的变种的经典累积和(Cumulative Sum,Cumulative Sum)算法的最快变化检测。这种变体基于Fisher散度和Hyvärinen分数,被称为基于分数的计算(SCUSUM)算法。SCUSUM算法允许对非标准化统计模型应用变化检测,即,概率密度函数包含未知归一化常数的模型。该算法的渐近最优性研究推导表达式的平均检测延迟和平均运行时间的虚警。数值结果证明了所提出的算法的性能。
英文摘要:
Classical quickest change detection algorithms require modeling pre-change and post-change distributions. Such an approach may not be feasible for various machine learning models because of the complexity of computing the explicit distributions. Additionally, these methods may suffer from a lack of robustness to model mismatch and noise. This paper develops a new variant of the classical Cumulative Sum (CUSUM) algorithm for the quickest change detection. This variant is based on Fisher divergence and the Hyvärinen score and is called the Score-based CUSUM (SCUSUM) algorithm. The SCUSUM algorithm allows the applications of change detection for unnormalized statistical models, i.e., models for which the probability density function contains an unknown normalization constant. The asymptotic optimality of the proposed algorithm is investigated by deriving expressions for average detection delay and the mean running time to a false alarm. Numerical results are provided to demonstrate the performance of the proposed algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。