TL;DR
This paper introduces two neural network-based online change-point detection methods that are computationally efficient, outperform existing algorithms, and are suitable for large-scale time series analysis.
Contribution
The paper presents novel online neural network algorithms for change-point detection with proven convergence and superior performance over traditional offline methods.
Findings
Algorithms have linear computational complexity.
Proposed methods outperform existing approaches.
Convergence to optimal solutions is proven.
Abstract
Moments when a time series changes its behavior are called change points. Occurrence of change point implies that the state of the system is altered and its timely detection might help to prevent unwanted consequences. In this paper, we present two change-point detection approaches based on neural networks and online learning. These algorithms demonstrate linear computational complexity and are suitable for change-point detection in large time series. We compare them with the best known algorithms on various synthetic and real world data sets. Experiments show that the proposed methods outperform known approaches. We also prove the convergence of the algorithms to the optimal solutions and describe conditions rendering current approach more powerful than offline one.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
