Consistent change-point detection with kernels:

Damien Garreau 1, 2 Sylvain Arlot 3, 4
2 SIERRA - Statistical Machine Learning and Parsimony
DI-ENS - Département d'informatique de l'École normale supérieure, ENS Paris - École normale supérieure - Paris, CNRS - Centre National de la Recherche Scientifique, Inria de Paris
4 SELECT - Model selection in statistical learning
Inria Saclay - Ile de France, LMO - Laboratoire de Mathématiques d'Orsay, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : In this paper we study the kernel change-point algorithm (KCP) proposed by Arlot, Celisse and Harchaoui (2012), which aims at locating an unknown number of change-points in the distribution of a sequence of independent data taking values in an arbitrary set. The change-points are selected by model selection with a penalized kernel empirical criterion. We provide a non-asymptotic result showing that, with high probability, the KCP procedure retrieves the correct number of change-points, provided that the constant in the penalty is well-chosen; iin addition, KCP estimates the change-points location at the optimal rate. As a consequence, when using a characteristic kernel, KCP detects all kinds of change in the distribution (not only changes in the mean or the variance), and it is able to do so for complex structured data (not necessarily in $\mathbb{R}^d$). Most of the analysis is conducted assuming that the kernel is bounded; part of the results can be extended when we only assume a finite second-order moment.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées
Contributor : Damien Garreau <>
Submitted on : Wednesday, June 28, 2017 - 5:03:30 PM
Last modification on : Thursday, July 6, 2017 - 1:10:11 AM


Files produced by the author(s)


  • HAL Id : hal-01416704, version 2
  • ARXIV : 1612.04740



Damien Garreau, Sylvain Arlot. Consistent change-point detection with kernels. 2016. <hal-01416704v2>



Record views


Document downloads