arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.03591stat.ME
收藏

一种公共变点检测方法的推广

Parallelisation of a Common Changepoint Detection Method

S. O. Tickle, I. A. Eckley, P. Fearnhead, K. Haynes

摘要:

近年来,已经提出了各种有效地检测单变量设置中的变点的方法,其中一种流行的方法涉及使用动态规划来最小化惩罚成本函数。在某些情况下,这些算法可以具有在数据点的数量上是线性的预期计算成本;然而,最坏情况下的成本仍然是二次的。我们介绍了两种提高这些方法的计算性能的方法,都是基于并行化的动态规划方法。我们建立了并行化可以提供大量的计算改进:在某些情况下,计算成本大致以所使用的核心数量的二次方下降。这些并行实现不再保证找到真正的最小惩罚成本,但是,我们表明,他们保留了相同的渐近保证,在估计的数量和位置的变化的准确性。

英文摘要:

In recent years, various means of efficiently detecting changepoints in the univariate setting have been proposed, with one popular approach involving minimising a penalised cost function using dynamic programming. In some situations, these algorithms can have an expected computational cost that is linear in the number of data points; however, the worst case cost remains quadratic. We introduce two means of improving the computational performance of these methods, both based on parallelising the dynamic programming approach. We establish that parallelisation can give substantial computational improvements: in some situations the computational cost decreases roughly quadratically in the number of cores used. These parallel implementations are no longer guaranteed to find the true minimum of the penalised cost; however, we show that they retain the same asymptotic guarantees in terms of their accuracy in estimating the number and location of the changes.

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

↑