平滑k均值变点检测的收敛速度
Convergence rates for smooth k-means change-point detection
摘要:
在本文中,我们考虑在高斯模型中的可能高维数据的变点估计,使用k-均值方法。我们证明,直到对数项,这个变点估计有一个极小极大收敛速率。然后,考虑到稀疏数据的情况下,与Sobolev正则性,我们提出了一个平滑过程的基础上Lepski的方法,并表明所得到的估计达到最佳的收敛速率。我们的结果说明了一些模拟。由于依赖于Lepski方法的理论陈述取决于一些未知常数,建议执行最佳平滑的实用策略。
英文摘要:
In this paper, we consider the estimation of a change-point for possibly high-dimensional data in a Gaussian model, using a k-means method. We prove that, up to a logarithmic term, this change-point estimator has a minimax rate of convergence. Then, considering the case of sparse data, with a Sobolev regularity, we propose a smoothing procedure based on Lepski's method and show that the resulting estimator attains the optimal rate of convergence. Our results are illustrated by some simulations. As the theoretical statement relying on Lepski's method depends on some unknown constant, practical strategies are suggested to perform an optimal smoothing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。