Changepoint Detection in the Presence of Outliers

TL;DR

This paper introduces a robust changepoint detection method that effectively handles outliers by using bounded loss functions like biweight, suitable for online analysis and demonstrated on various real-world applications.

Contribution

It proposes a novel robust penalised cost approach with an efficient dynamic programming algorithm for online changepoint detection in the presence of outliers.

Findings

Accurately estimates number and locations of changepoints

Effective in online settings with outliers

Demonstrated on real-world datasets

Abstract

Many traditional methods for identifying changepoints can struggle in the presence of outliers, or when the noise is heavy-tailed. Often they will infer additional changepoints in order to fit the outliers. To overcome this problem, data often needs to be pre-processed to remove outliers, though this is difficult for applications where the data needs to be analysed online. We present an approach to changepoint detection that is robust to the presence of outliers. The idea is to adapt existing penalised cost approaches for detecting changes so that they use loss functions that are less sensitive to outliers. We argue that loss functions that are bounded, such as the classical biweight loss, are particularly suitable -- as we show that only bounded loss functions are robust to arbitrarily extreme outliers. We present an efficient dynamic programming algorithm that can find the optimal segmentation under our penalised cost criteria. Importantly, this algorithm can be used in settings where the data needs to be analysed online. We show that we can consistently estimate the number of changepoints, and accurately estimate their locations, using the biweight loss function. We demonstrate the usefulness of our approach for applications such as analysing well-log data, detecting copy number variation, and detecting tampering of wireless devices.