Active Learning for Multiple Change Point Detection in Non-stationary Time Series with Deep Gaussian Processes
- URL: http://arxiv.org/abs/2505.20452v1
- Date: Mon, 26 May 2025 18:46:59 GMT
- Title: Active Learning for Multiple Change Point Detection in Non-stationary Time Series with Deep Gaussian Processes
- Authors: Hao Zhao, Rong Pan,
- Abstract summary: Multiple change point (MCP) detection in non-stationary time series is challenging due to the variety of underlying patterns.<n>We propose a novel algorithm that integrates Active Learning (AL) with Deep Gaussian Processes (DGPs) for robust MCP detection.
- Score: 7.266872790554742
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Multiple change point (MCP) detection in non-stationary time series is challenging due to the variety of underlying patterns. To address these challenges, we propose a novel algorithm that integrates Active Learning (AL) with Deep Gaussian Processes (DGPs) for robust MCP detection. Our method leverages spectral analysis to identify potential changes and employs AL to strategically select new sampling points for improved efficiency. By incorporating the modeling flexibility of DGPs with the change-identification capabilities of spectral methods, our approach adapts to diverse spectral change behaviors and effectively localizes multiple change points. Experiments on both simulated and real-world data demonstrate that our method outperforms existing techniques in terms of detection accuracy and sampling efficiency for non-stationary time series.
Related papers
- WWAggr: A Window Wasserstein-based Aggregation for Ensemble Change Point Detection [47.93621184800604]
Change Point Detection (CPD) aims to identify moments of abrupt distribution shifts in data streams.<n>Current state-of-the-art detectors have yet to achieve perfect quality.<n>We introduce WWAggr -- a novel task-specific method of ensemble aggregation based on the Wasserstein distance.
arXiv Detail & Related papers (2025-06-09T13:52:10Z) - Optimizing Multispectral Object Detection: A Bag of Tricks and Comprehensive Benchmarks [49.84182981950623]
Multispectral object detection, utilizing RGB and TIR (thermal infrared) modalities, is widely recognized as a challenging task.<n>It requires not only the effective extraction of features from both modalities and robust fusion strategies, but also the ability to address issues such as spectral discrepancies.<n>We introduce an efficient and easily deployable multispectral object detection framework that can seamlessly optimize high-performing single-modality models.
arXiv Detail & Related papers (2024-11-27T12:18:39Z) - Partially-Observable Sequential Change-Point Detection for Autocorrelated Data via Upper Confidence Region [12.645304808491309]
We propose a detection scheme called adaptive upper confidence region with state space model (AUCRSS) for sequential change point detection.
A partially-observable Kalman filter algorithm is developed for online inference of SSM, and accordingly, a change point detection scheme based on a generalized likelihood ratio test is analyzed.
arXiv Detail & Related papers (2024-03-30T02:32:53Z) - Robust Analysis of Multi-Task Learning Efficiency: New Benchmarks on Light-Weighed Backbones and Effective Measurement of Multi-Task Learning Challenges by Feature Disentanglement [69.51496713076253]
In this paper, we focus on the aforementioned efficiency aspects of existing MTL methods.
We first carry out large-scale experiments of the methods with smaller backbones and on a the MetaGraspNet dataset as a new test ground.
We also propose Feature Disentanglement measure as a novel and efficient identifier of the challenges in MTL.
arXiv Detail & Related papers (2024-02-05T22:15:55Z) - Graph Spatiotemporal Process for Multivariate Time Series Anomaly
Detection with Missing Values [67.76168547245237]
We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies.
Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
arXiv Detail & Related papers (2024-01-11T10:10:16Z) - Ensemble Kalman Filtering Meets Gaussian Process SSM for Non-Mean-Field and Online Inference [47.460898983429374]
We introduce an ensemble Kalman filter (EnKF) into the non-mean-field (NMF) variational inference framework to approximate the posterior distribution of the latent states.
This novel marriage between EnKF and GPSSM not only eliminates the need for extensive parameterization in learning variational distributions, but also enables an interpretable, closed-form approximation of the evidence lower bound (ELBO)
We demonstrate that the resulting EnKF-aided online algorithm embodies a principled objective function by ensuring data-fitting accuracy while incorporating model regularizations to mitigate overfitting.
arXiv Detail & Related papers (2023-12-10T15:22:30Z) - Dynamic Interpretable Change Point Detection [9.879634139205569]
TiVaCPD is an approach that uses a Time-Varying Graphical Lasso to identify changes in correlation patterns between multidimensional features over time.
We evaluate the performance of TiVaCPD in identifying and characterizing various types of CPs and show that our method outperforms current state-of-the-art methods in real-world CPD datasets.
arXiv Detail & Related papers (2022-11-08T04:04:56Z) - Latent Neural Stochastic Differential Equations for Change Point
Detection [0.6445605125467574]
We present a novel change point detection algorithm based on Latent Neural Differential Equations (SDE)
Our method learns a non-linear deep learning transformation of the process into a latent space and estimates a SDE that describes its evolution over time.
The algorithm uses the likelihood ratio of the learned processes in different timestamps to find change points of the process.
arXiv Detail & Related papers (2022-08-22T13:53:13Z) - WATCH: Wasserstein Change Point Detection for High-Dimensional Time
Series Data [4.228718402877829]
Change point detection methods have the ability to discover changes in an unsupervised fashion.
We propose WATCH, a novel Wasserstein distance-based change point detection approach.
An extensive evaluation shows that WATCH is capable of accurately identifying change points and outperforming state-of-the-art methods.
arXiv Detail & Related papers (2022-01-18T16:55:29Z) - Adaptive Gradient Method with Resilience and Momentum [120.83046824742455]
We propose an Adaptive Gradient Method with Resilience and Momentum (AdaRem)
AdaRem adjusts the parameter-wise learning rate according to whether the direction of one parameter changes in the past is aligned with the direction of the current gradient.
Our method outperforms previous adaptive learning rate-based algorithms in terms of the training speed and the test error.
arXiv Detail & Related papers (2020-10-21T14:49:00Z) - Change Point Detection in Time Series Data using Autoencoders with a
Time-Invariant Representation [69.34035527763916]
Change point detection (CPD) aims to locate abrupt property changes in time series data.
Recent CPD methods demonstrated the potential of using deep learning techniques, but often lack the ability to identify more subtle changes in the autocorrelation statistics of the signal.
We employ an autoencoder-based methodology with a novel loss function, through which the used autoencoders learn a partially time-invariant representation that is tailored for CPD.
arXiv Detail & Related papers (2020-08-21T15:03:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.