Online detection of abrupt changes in high-dimensional data streams.
problem Detecting abrupt changes in high-dimensional, streaming data with multiple subspaces.
method Dynamic sparse subspace learning approach with multiple structural change-point model, Bayesian information criterion for penalty coefficients selection, and Pruned Exact Linear Time algorithm.
result Effectiveness demonstrated through simulation and real gesture data studies.
Proposes a model to detect changes in multivariate time series data.
problem Detect abrupt changes in multivariate time series data considering dependencies and correlations.
method Integrates graph neural networks into an encoder-decoder framework to model correlation structures and dynamics.
result Advantageous performance on CPD tasks over strong baselines, classifying changes as correlation or independent.
New algorithm detects changes in high-dimensional data with mean and variance.
problem Challenges in detecting changes in high-dimensional data with mean and variance.
method Complete graph-based approach to detect changes of mean and variance from low to high-dimensional online data.
result The proposed method outperforms existing methods in terms of detection power.
Graph change-point detection method learns graph similarity from data.
problem Detect abrupt changes in dynamic networks.
method Siamese graph neural network for graph similarity learning.
result Method detects changes in diverse types of networks with minimal data history.
New MIP approach for efficient change-point detection.
problem Offline multiple change-point detection in data streams.
method Mixed-integer programming (MIP) for globally optimal PWL fitting.
result Provable tighter relaxations for segment assignment variables.
Detects graph topology changes from noisy signals using prior spectral information.
problem Detecting changes in graph topology from graph signals.
method Leverages graph filtering and subspace detection to distill problem into a CUSUM-based algorithm.
result Demonstrates the effectiveness of incorporating prior spectral signatures for change-point detection.
A new method detects change points in time series with conceptors.
problem Detecting change points in time series with nonlinear temporal dependence.
method Use of conceptor matrix to learn baseline dynamics and identify change points.
result The method provides a consistent estimate of the true change point.
GOCPD detects change points by maximizing the probability of two independent models.
problem Large false discovery rates in online change point detection methods.
method GOCPD uses ternary search to find change points by maximizing the probability of two independent models.
result GOCPD accelerates CPD with logarithmic complexity for single change point detection.
Detects change points in time series focusing on specific components.
problem Identifying moments when specific components of multivariate time series change distributions.
method Two-stage non-parametric algorithm: causal structure learning followed by change point detection.
result Validated the approach on synthetic and real-world datasets.
Unified framework detects changes in complex system models.
problem Accurate identification of dynamic changes in simulation models.
method Combines machine learning and process-driven simulation modeling.
result Significantly improves change point detection accuracy.
Develops a method to detect changes in linear systems with temporal correlations.
problem Detect abrupt changes in time series data with temporal correlations.
method Data-dependent threshold for online change point detection in linear dynamical systems.
result Achieves a pre-specified upper bound on the probability of false alarms and provides a finite-sample-based bound for detection probability.
New method detects structural shifts in multivariate Hawkes processes.
problem Detecting changes in multivariate Hawkes processes.
method Using Fréchet statistics on overlapping windows of causal network.
result Accurately detects and characterizes changes in causal structure.
Locally private methods detect changes in time series data.
problem Detecting distributional changes in time series data under local differential privacy.
method Proposed locally differentially private algorithms based on randomized response and binary mechanisms.
result Theoretical performance bounds and empirical validation of detection accuracy.
We consider the problem of quickest change-point detection in data streams. Classical change-point detection procedures, such as CUSUM, Shiryaev-Roberts and Posterior Probability statistics, are optimal only if the change-point model is known, which is an unrealistic assumption in typical applied problems. Instead we p…
Paper presents neural network-based change-point detection methods.
problem Detecting change points in time series data.
method Online neural networks for change-point detection.
result Proposed methods outperform existing algorithms.
Interactions among people or objects are often dynamic in nature and can be represented as a sequence of networks, each providing a snapshot of the interactions over a brief period of time. An important task in analyzing such evolving networks is change-point detection, in which we both identify the times at which the …
Improves change-point detection for high-dimensional time-series.
problem Uncertainty in latent variable estimation affects change-point detection.
method Proposes multinomial sampling to improve detection rate and reduce delay.
result Results outperform baseline method in experiments.
A conjugate Bayesian method detects change points in Hawkes processes efficiently.
problem Non-conjugacy between Hawkes process likelihood and prior causes inefficiency in change point detection.
method Data augmentation to propose a conjugate Bayesian two-step change point detection method.
result The conjugate method is more accurate and efficient than non-conjugate methods.
NN-CUSUM detects changes in high-dimensional data using neural networks.
problem Detecting abrupt changes in high-dimensional data.
method Neural network-based CUSUM for online change-point detection.
result NN-CUSUM performs well in detecting changes in high-dimensional data.
MOSAIC detects change points in dynamic networks with low-rank and sparse changes.
problem Detecting change points in dynamic networks with specific structural properties.
method Eigen-decomposition-based test with screened signals and residual-based adjustment.
result MOSAIC achieves minimax-optimal detection and testing rates.
Evaluates change point detection algorithms on real-world data.
problem Insufficient evaluation of change point detection algorithms on real-world time series.
method Developed a data set of 37 time series from various domains, annotated by human experts, and evaluated 14 algorithms using consistency metrics.
result Demonstrates the need for better evaluation methods in change point detection.
Post-detection analysis identifies responsible coordinates for multivariate change-points.
problem Identifying which coordinates in multivariate time series change after a detected change-point.
method Two-sample testing procedures with nonparametric tests for Type I error control.
result Strong performance of proposed post hoc statistical procedures.
A new method detects changes in multivariate data using random forests.
problem Detecting changes in multivariate data.
method A computationally feasible search method using random forests and class probability predictions.
result Consistently locates change points in simulations.
New method detects text changes under dependencies, outperforming baselines.
problem Detecting structural changes in m-dependent text data. method Kernel change-point detection under m-dependence. result Consistent and weakly consistent detection of change points in m-dependent text. Boosts change-point detection power with optimal sub-sampling.
problem Power loss in sequential change-point detection from large history data.
method Optimal sub-sampling of history data before kernel-based detection procedures.
result Improved detection performance in extensive experiments.
We propose estimation methods for change points in high-dimensional covariance structures with an emphasis on challenging scenarios with missing values. We advocate three imputation like methods and investigate their implications on common losses used for change point detection. We also discuss how model selection meth…
We introduce a novel geometry-oriented methodology, based on the emerging tools of topological data analysis, into the change point detection framework. The key rationale is that change points are likely to be associated with changes in geometry behind the data generating process. While the applications of topological …
AUCRSS detects change points in partially observed multivariate autocorrelated data.
problem Detecting change points in multivariate autocorrelated data with limited sensing resources.
method Adaptive Upper Confidence Region (AUCRSS) with state space model (SSM), adaptive sampling policy, and generalized likelihood ratio test.
result The method outperforms existing approaches in detecting change points efficiently.
Unified framework detects change-points and estimates parameters in nonlinear systems with regime switching.
problem Detecting change-points and estimating parameters in nonlinear dynamical systems with regime transitions.
method Residual-loss anomaly analysis of physics-informed neural networks, two-stage strategy.
result The method outperforms traditional approaches in change-point localization and parameter estimation accuracy.
New method detects changes by maximizing cross-entropy, outperforming existing techniques.
problem Detecting abrupt changes in data streams without labeled examples.
method Maximizes cross-entropy between segments to find change points, using dynamic programming.
result Outperforms three state-of-the-art approaches on challenging datasets.
Paper extends SI method for detecting CPs in complex systems' frequency domain.
problem Identifying change points in complex systems' frequency domain.
method Extends SI framework to frequency domain using DFT properties and develops valid p-values.
result Reliable detection of genuine CPs with strong statistical guarantees.
The high structural deficient rate poses serious risks to the operation of many bridges and buildings. To prevent critical damage and structural collapse, a quick structural health diagnosis tool is needed during normal operation or immediately after extreme events. In structural health monitoring (SHM), many existing …
SoccerCPD detects tactical changes in soccer matches using spatiotemporal tracking data.
problem Detecting consistent team formations in fluid sports like soccer.
method Two-step change-point detection: formation and role changes.
result Accurately detects tactical changes and estimates formation and role assignments.
Optimistic search speeds up change point detection in large datasets.
problem Efficiently detecting change points in large-scale data with high computational demands.
method Adaptive logarithmic queries to reduce evaluation complexity.
result Asymptotic minimax optimality and fast localization rates for change point detection.
The paper develops a neural network-based method for detecting change points in large-scale time-evolving data.
problem Detecting and locating change points in multivariate time-evolving data.
method Two-step procedure involving neural network training and test error function calibration over moving windows.
result Consistent estimates for the number and locations of change points under temporal dependence.
This paper improves change-point detection for complex data streams using denoising score matching.
problem Timely identification of distributional shifts in high-dimensional, complex data streams.
method Score-based CUSUM change-point detection with denoising score matching.
result Denoising score matching enhances detection power by effectively controlling noise scale.
KCUSUM detects abrupt changes in real-time data streams efficiently.
problem Detecting abrupt changes in high-volume scientific data streams.
method Kernel-based Cumulative Sum (KCUSUM) algorithm using Maximum Mean Discrepancy (MMD).
result KCUSUM outperforms traditional CUSUM in online change point detection.
New AMP algorithm detects change points in high-dimensional GLMs.
problem Detecting change points in high-dimensional GLMs.
method Approximate Message Passing (AMP) algorithm for estimating signals and change points.
result Characterization of AMP algorithm's performance in high-dimensional limit.
Novel optimization method detects change points in Gaussian data.
problem Detecting change points in univariate Gaussian data sequences.
method Continuous optimization for best subset selection (COMBSS) applied to a reformulated statistical inverse problem.
result Adaptation and evaluation of COMBSS for offline normal mean multiple change-point detection.
PERCEPT detects changes in high-dimensional data streams using topological data analysis.
problem Detecting changes in high-dimensional data streams, especially when embedded in a low-dimensional space.
method Leverages topological data analysis to learn embedded topology as a point cloud via persistence diagrams, then applies non-parametric monitoring for detecting changes.
result Demonstrates efficient detection of online changes from high-dimensional data streams.
In the analysis of sequential data, the detection of abrupt changes is important in predicting future changes. In this paper, we propose statistical hypothesis tests for detecting covariance structure changes in locally smooth time series modeled by Gaussian Processes (GPs). We provide theoretically justified threshold…
We consider the problem of change-point detection in multivariate time-series. The multivariate distribution of the observations is supposed to follow a graphical model, whose graph and parameters are affected by abrupt changes throughout time. We demonstrate that it is possible to perform exact Bayesian inference when…
Paper reproduces a kernel-based scan B-statistic for online change-point detection.
problem Continuous detection of distribution changes in online data streams.
method Efficient kernel-based scan B-statistic for online change-point detection.
result Scan B-statistic outperforms parametric methods in challenging scenarios.
New algorithms detect and react to multiple change points in online learning.
problem Learning under multiple change points in environments with unknown and frequent shifts.
method Proposed Anytime Tracking CUSUM (ATC) algorithms that balance detection of significant shifts.
result Properly tuned ATC algorithms achieve nearly minimax-optimal performance.
Improved hypothesis testing and change-point detection using diffusion-based methods.
problem Limited power of score-based hypothesis tests and change-point detection.
method Extending score-based Fisher divergence to diffusion-divergence by multiplying score functions with a matrix-valued function or weight matrix.
result Theoretical quantification and demonstration of optimal performance of diffusion-based algorithms.
This paper addresses the problem of change-point detection on sequences of high-dimensional and heterogeneous observations, which also possess a periodic temporal structure. Due to the dimensionality problem, when the time between change-points is on the order of the dimension of the model parameters, drifts in the und…
Efficient online kernel CUSUM detects changes quickly and accurately.
problem Detecting changes in online data streams efficiently.
method Online kernel CUSUM using maximum kernel statistics.
result Increased sensitivity to small changes compared to existing methods.
We propose a probabilistic formulation that enables sequential detection of multiple change points in a network setting. We present a class of sequential detection rules for certain functionals of change points (minimum among a subset), and prove their asymptotic optimality properties in terms of expected detection del…