Wild Binary Segmentation for multiple change-point detection
Piotr Fryzlewicz (London School of Econnomics)
Friday 15th November, 2013 15:00-16:00 Maths 204
We propose a new technique, called Wild Binary Segmentation (WBS), for consistent estimation of the number and locations of multiple change-points in data. We assume that the number of change-points can increase to infinity with the sample size. Due to a certain random localisation mechanism, WBS works even for very short spacings between the change-points, unlike standard Binary Segmentation. On the other hand, despite its use of localisation, WBS does not require the choice of a window or span parameter, and does not lead to significant increase in computational complexity. WBS is also easy to code. We provide default recommended values of the parameters of the procedure and show that it offers very good practical performance. In addition, we provide a new proof of consistency of Binary Segmentation with improved rates of convergence, as well as a corresponding result for WBS.