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

11/05/2019
by   Chao Zheng, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/23/2022

cpop: Detecting changes in piecewise-linear signals

Changepoint detection is an important problem with applications across m...
research
12/11/2014

Efficient penalty search for multiple changepoint problems

In the multiple changepoint setting, various search methods have been pr...
research
12/31/2019

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

For sequentially observed functional data exhibiting multiple change poi...
research
06/04/2019

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...
research
01/06/2017

Detecting changes in slope with an L_0 penalty

Whilst there are many approaches to detecting changes in mean for a univ...
research
11/20/2019

Statistical Inference on Partially Linear Panel Model under Unobserved Linearity

A new statistical procedure, based on a modified spline basis, is propos...

Please sign up or login with your details

Forgot password? Click here to reset