IDEAS home Printed from https://ideas.repec.org/p/ehl/lserod/120083.html
   My bibliography  Save this paper

Automatic change-point detection in time series via deep learning

Author

Listed:
  • Li, Jie
  • Fearnhead, Paul
  • Fryzlewicz, Piotr
  • Wang, Tengyao

Abstract

Detecting change points in data is challenging because of the range of possible types of change and types of behaviour of data when there is no change. Statistically efficient methods for detecting a change will depend on both of these features, and it can be difficult for a practitioner to develop an appropriate detection method for their application of interest. We show how to automatically generate new offline detection methods based on training a neural network. Our approach is motivated by many existing tests for the presence of a change point being representable by a simple neural network, and thus a neural network trained with sufficient data should have performance at least as good as these methods. We present theory that quantifies the error rate for such an approach, and how it depends on the amount of training data. Empirical results show that, even with limited training data, its performance is competitive with the standard cumulative sum (CUSUM) based classifier for detecting a change in mean when the noise is independent and Gaussian, and can substantially outperform it in the presence of auto-correlated or heavy-tailed noise. Our method also shows strong results in detecting and localizing changes in activity based on accelerometer data.

Suggested Citation

  • Li, Jie & Fearnhead, Paul & Fryzlewicz, Piotr & Wang, Tengyao, 2024. "Automatic change-point detection in time series via deep learning," LSE Research Online Documents on Economics 120083, London School of Economics and Political Science, LSE Library.
  • Handle: RePEc:ehl:lserod:120083
    as

    Download full text from publisher

    File URL: http://eprints.lse.ac.uk/120083/
    File Function: Open access version.
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    automatic statistician; classification; likelihood-free inference; neural networks; structural breaks; supervised learning; e High End Computing Cluster at Lancaster University; and EPSRC grants EP/V053590/1; EP/V053639/1 and EP/T02772X/1;
    All these keywords.

    JEL classification:

    • C1 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ehl:lserod:120083. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: LSERO Manager (email available below). General contact details of provider: https://edirc.repec.org/data/lsepsuk.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.