Consistency of a range of penalised cost approaches for detecting multiple changepoints

by   Chao Zheng, et al.

A common approach to detect multiple changepoints is to minimise a measure of data fit plus a penalty that is linear in the number of changepoints. This paper shows that the general finite sample behaviour of such a method can be related to its behaviour when analysing data with either none or one changepoint. This results in simpler conditions for verifying whether the method will consistently estimate the number and locations of the changepoints. We apply and demonstrate the usefulness of this result for a range of changepoint problems. Our new results include a weaker condition on the choice of penalty required to have consistency in a change-in-slope model; and the first results for the accuracy of recently-proposed methods for detecting spikes.



There are no comments yet.


page 1

page 2

page 3

page 4


Efficient penalty search for multiple changepoint problems

In the multiple changepoint setting, various search methods have been pr...

Consistency of Binary Segmentation For Multiple Change-Points Estimation With Functional Data

For sequentially observed functional data exhibiting multiple change poi...

Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats

We treat the so-called scenario approach, a popular probabilistic approx...

Detecting changes in slope with an L_0 penalty

Whilst there are many approaches to detecting changes in mean for a univ...

Detecting changes in covariance via random matrix theory

A novel method is proposed for detecting changes in the covariance struc...

Detecting multiple change points: a PULSE criterion

The research described herewith investigates detecting change points of ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.