Efficient penalty search for multiple changepoint problems

12/11/2014
by   Kaylea Haynes, et al.
0

In the multiple changepoint setting, various search methods have been proposed which involve optimising either a constrained or penalised cost function over possible numbers and locations of changepoints using dynamic programming. Such methods are typically computationally intensive. Recent work in the penalised optimisation setting has focussed on developing a pruning-based approach which gives an improved computational cost that, under certain conditions, is linear in the number of data points. Such an approach naturally requires the specification of a penalty to avoid under/over-fitting. Work has been undertaken to identify the appropriate penalty choice for data generating processes with known distributional form, but in many applications the model assumed for the data is not correct and these penalty choices are not always appropriate. Consequently it is desirable to have an approach that enables us to compare segmentations for different choices of penalty. To this end we present a method to obtain optimal changepoint segmentations of data sequences for all penalty values across a continuous range. This permits an evaluation of the various segmentations to identify a suitably parsimonious penalty choice. The computational complexity of this approach can be linear in the number of data points and linear in the difference between the number of changepoints in the optimal segmentations for the smallest and largest penalty values. This can be orders of magnitude faster than alternative approaches that find optimal segmentations for a range of the number of changepoints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/08/2018

Parallelisation of a Common Changepoint Detection Method

In recent years, various means of efficiently detecting changepoints in ...
research
11/05/2019

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

A common approach to detect multiple changepoints is to minimise a measu...
research
08/23/2022

cpop: Detecting changes in piecewise-linear signals

Changepoint detection is an important problem with applications across m...
research
09/29/2018

Generalized Functional Pruning Optimal Partitioning (GFPOP) for Constrained Changepoint Detection in Genomic Data

We describe a new algorithm and R package for peak detection in genomic ...
research
06/20/2022

Penalty Weights in QUBO Formulations: Permutation Problems

Optimisation algorithms designed to work on quantum computers or other s...
research
07/20/2020

Choice of Interior Penalty Coefficient for Interior Penalty Discontinuous Galerkin Method for Biot's System by Employing Machine Learning

In this paper, the optimal choice of the interior penalty parameter of t...
research
06/06/2017

Shape Parameter Estimation

Performance of machine learning approaches depends strongly on the choic...

Please sign up or login with your details

Forgot password? Click here to reset