Active Learning for Abrupt Shifts Change-point Detection via Derivative-Aware Gaussian Processes

• URL: http://arxiv.org/abs/2312.03176v1
• Date: Tue, 5 Dec 2023 22:44:05 GMT
• Title: Active Learning for Abrupt Shifts Change-point Detection via Derivative-Aware Gaussian Processes
• Authors: Hao Zhao, Rong Pan
• Abstract summary: We introduce the Derivative-Aware Change Detection (DACD) method to pinpoint change-point locations effectively. By utilizing GP derivative mean and variance as criteria, DACD sequentially selects the next sampling data point. We investigate the effectiveness of DACD method in diverse scenarios and show it outperforms other active learning change-point detection approaches.
• Score: 8.584847547809368
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Change-point detection (CPD) is crucial for identifying abrupt shifts in data, which influence decision-making and efficient resource allocation across various domains. To address the challenges posed by the costly and time-intensive data acquisition in CPD, we introduce the Derivative-Aware Change Detection (DACD) method. It leverages the derivative process of a Gaussian process (GP) for Active Learning (AL), aiming to pinpoint change-point locations effectively. DACD balances the exploitation and exploration of derivative processes through multiple data acquisition functions (AFs). By utilizing GP derivative mean and variance as criteria, DACD sequentially selects the next sampling data point, thus enhancing algorithmic efficiency and ensuring reliable and accurate results. We investigate the effectiveness of DACD method in diverse scenarios and show it outperforms other active learning change-point detection approaches.

Related papers

• MuRAL-CPD: Active Learning for Multiresolution Change Point Detection [2.3711752696597435]
  Change Point Detection (CPD) is a critical task in time series analysis, aiming to identify moments when the underlying data-generating process shifts.<n>Traditional CPD methods often rely on unsupervised techniques, which lack adaptability to task-specific definitions of change.<n>We propose MuRAL-CPD, a novel semi-supervised method that integrates active learning into a multiresolution CPD algorithm.
  arXiv  Detail & Related papers  (2026-01-28T15:14:37Z)
• Detecting Domain Shifts in Myoelectric Activations: Challenges and Opportunities in Stream Learning [18.23599191355636]
  This paper explores the detection of domain shifts using data stream (DS) learning techniques, focusing on the DB6 dataset from the Ninapro database.<n>We define domains as distinct time-series segments based on different subjects and recording sessions, applying Kernel Principal Component Analysis (KPCA) with a cosine kernel to pre-process and highlight these shifts.<n>Our results underscore the potential of streaming-based approaches for maintaining stable EMG decoding models, while highlighting areas for further research to enhance robustness and accuracy in real-world scenarios.
  arXiv  Detail & Related papers  (2025-08-29T00:47:28Z)
• 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)
• Efficient Test-time Adaptive Object Detection via Sensitivity-Guided Pruning [73.40364018029673]
  Continual test-time adaptive object detection (CTTA-OD) aims to online adapt a source pre-trained detector to ever-changing environments.<n>Our motivation stems from the observation that not all learned source features are beneficial.<n>Our method achieves superior adaptation performance while reducing computational overhead by 12% in FLOPs.
  arXiv  Detail & Related papers  (2025-06-03T05:27:56Z)
• Active Learning for Multiple Change Point Detection in Non-stationary Time Series with Deep Gaussian Processes [7.266872790554742]
  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.
  arXiv  Detail & Related papers  (2025-05-26T18:46:59Z)
• Geodesic Optimization for Predictive Shift Adaptation on EEG data [53.58711912565724]
  Domain adaptation methods struggle when distribution shifts occur simultaneously in $X$ and $y$. This paper proposes a novel method termed Geodesic Optimization for Predictive Shift Adaptation (GOPSA) to address test-time multi-source DA. GOPSA has the potential to combine the advantages of mixed-effects modeling with machine learning for biomedical applications of EEG.
  arXiv  Detail & Related papers  (2024-07-04T12:15:42Z)
• DACAD: Domain Adaptation Contrastive Learning for Anomaly Detection in Multivariate Time Series [61.91288852233078]
  In time series anomaly detection, the scarcity of labeled data poses a challenge to the development of accurate models.<n>We propose a novel Domain Contrastive learning model for Anomaly Detection in time series (DACAD)<n>Our model employs supervised contrastive loss for the source domain and self-supervised contrastive triplet loss for the target domain.
  arXiv  Detail & Related papers  (2024-04-17T11:20:14Z)
• Continual-MAE: Adaptive Distribution Masked Autoencoders for Continual Test-Time Adaptation [49.827306773992376]
  Continual Test-Time Adaptation (CTTA) is proposed to migrate a source pre-trained model to continually changing target distributions. Our proposed method attains state-of-the-art performance in both classification and segmentation CTTA tasks.
  arXiv  Detail & Related papers  (2023-12-19T15:34:52Z)
• Effective Restoration of Source Knowledge in Continual Test Time Adaptation [44.17577480511772]
  This paper introduces an unsupervised domain change detection method that is capable of identifying domain shifts in dynamic environments. By restoring the knowledge from the source, it effectively corrects the negative consequences arising from the gradual deterioration of model parameters. We perform extensive experiments on benchmark datasets to demonstrate the superior performance of our method compared to state-of-the-art adaptation methods.
  arXiv  Detail & Related papers  (2023-11-08T19:21:48Z)
• Greedy online change point detection [0.0]
  Greedy Online Change Point Detection (GOCPD) is a computationally appealing method which finds change points by maximizing the probability of the data coming from the (temporal) concatenation of two independent models. We show that, for time series with a single change point, this objective is unimodal and thus CPD can be accelerated via ternary search with logarithmic complexity.
  arXiv  Detail & Related papers  (2023-08-14T08:59:59Z)
• Learning Better with Less: Effective Augmentation for Sample-Efficient Visual Reinforcement Learning [57.83232242068982]
  Data augmentation (DA) is a crucial technique for enhancing the sample efficiency of visual reinforcement learning (RL) algorithms. It remains unclear which attributes of DA account for its effectiveness in achieving sample-efficient visual RL. This work conducts comprehensive experiments to assess the impact of DA's attributes on its efficacy.
  arXiv  Detail & Related papers  (2023-05-25T15:46:20Z)
• Deep Metric Learning for Unsupervised Remote Sensing Change Detection [60.89777029184023]
  Remote Sensing Change Detection (RS-CD) aims to detect relevant changes from Multi-Temporal Remote Sensing Images (MT-RSIs) The performance of existing RS-CD methods is attributed to training on large annotated datasets. This paper proposes an unsupervised CD method based on deep metric learning that can deal with both of these issues.
  arXiv  Detail & Related papers  (2023-03-16T17:52:45Z)
• Detecting Change Intervals with Isolation Distributional Kernel [20.629723195973412]
  We are first to generalise the CPD problem as a special case of the Change-Interval Detection (CID) problem. We propose a CID method, named iCID, based on a recent Isolation Distributional Kernel (IDK) The effectiveness and efficiency of iCID have been systematically verified on both synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2022-12-30T10:56:56Z)
• Variance-Aware Off-Policy Evaluation with Linear Function Approximation [85.75516599931632]
  We study the off-policy evaluation problem in reinforcement learning with linear function approximation. We propose an algorithm, VA-OPE, which uses the estimated variance of the value function to reweight the Bellman residual in Fitted Q-Iteration.
  arXiv  Detail & Related papers  (2021-06-22T17:58:46Z)
• Principled change point detection via representation learning [0.6047855579999899]
  We introduce a principled differentiable loss function that considers the specificity of the CPD task. We propose an end-to-end method for the training of deep representation learning CPD models.
  arXiv  Detail & Related papers  (2021-06-04T17:04:13Z)
• Detection of Dataset Shifts in Learning-Enabled Cyber-Physical Systems using Variational Autoencoder for Regression [1.5039745292757671]
  We propose an approach to detect the dataset shifts effectively for regression problems. Our approach is based on the inductive conformal anomaly detection and utilizes a variational autoencoder for regression model. We demonstrate our approach by using an advanced emergency braking system implemented in an open-source simulator for self-driving cars.
  arXiv  Detail & Related papers  (2021-04-14T03:46:37Z)
• 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.