New framework detects policy changes in black-box DMS over time.
problem Lack of transparency in black-box decision making systems.
method Proposes temporal transparency, maps to time series changepoint detection, develops framework.
result Reveals policy changes in real-world DMS, including announced and unannounced.
A new framework detects changes in multi-armed bandit problems.
problem Change in reward distributions over time in multi-armed bandit problems.
method Change-detection (CD) based UCB policies, CUSUM-UCB, PHT-UCB.
result CUSUM-UCB obtains the best known regret upper bound.
A new algorithm detects changes in high-dimensional data efficiently under sampling constraints.
problem Real-time monitoring of high-dimensional streaming data with limited sampling.
method Incorporates multi-armed bandit approaches into sequential change-point detection.
result Proposes TSSRP algorithm for efficient detection of changes.
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.
New RL method tackles dynamic, heterogeneous data.
problem Temporal non-stationarity and subject heterogeneity in reinforcement learning.
method Alternates between change point detection and cluster identification.
result Improves policy learning by detecting similar dynamics over time and across individuals.
Algorithm detects causal change points quickly with adaptive interventions.
problem Detecting changes in causal models with interventions.
method Centralization technique, Kullback-Leibler divergence for intervention selection, adaptive intervention policy.
result Theoretical first-order optimality and validation through simulations and real-world studies.
Develops deep jump learning for continuous treatment OPE.
problem Estimating mean outcomes under new treatment rules using historical data from different rules.
method Adaptive deep discretization of continuous treatment space using deep learning and multi-scale change point detection.
result Validated method through theoretical results, simulations, and real application to Warfarin Dosing.
Develops methods to test nonstationarity and detect change points in RL.
problem Nonstationary environments in reinforcement learning.
method Consistent testing procedure and change point detection method.
result Validates the effectiveness of the proposed methods in real data.
SNPL learns safe policies for multi-objective interventions with high confidence.
problem Designing effective digital interventions balancing multiple objectives with noisy data.
method Leverages algorithmic stability to learn policies with high-confidence guarantees.
result Offers dramatic improvements in safety and policy gains with smaller sample sizes.
ReCAP adapts to dynamic financial markets by segmenting and combining policy vectors.
problem Inefficient traditional PM approaches in non-stationary financial markets.
method Integrates continual learning into PM, segmenting regimes and adapting policies.
result Consistently outperforms baselines in real-world financial datasets.
Bayesian model detects sudden changes in stock market correlations during pandemic.
problem Capturing sudden structural changes in financial dependence during global events.
method Develops a Bayesian multivariate stochastic volatility model based on time-varying graphs.
result Captures abrupt changes in dependence structure across US stock portfolios.
Machine learning detects drug overdose trends, aiding prevention.
problem Detecting subtle overdose patterns in spatio-temporal data.
method Gaussian Process Subset Scan and Multidimensional Tensor Scan.
result Identifies previously unknown overdose patterns and demographic clusters.
Rarely switch policies to optimize treatment effects, reducing harmful changes.
problem Difficult to change policies frequently in real-world scenarios.
method Developed a conservative policy updating procedure for rarely-switching linear bandits.
result The procedure optimizes policies with fewer changes and fewer detrimental changes.
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 changes in data streams efficiently.
problem Quickest change-point detection in data streams.
method Inductive Conformal Martingales for quickest change-point detection.
result Inductive Conformal Martingales are efficient under general conditions.
Detects change-points in similarity networks to identify anomalous nodes.
problem Detecting changes in network structure that affect node similarity.
method Sequential node-wise average similarity measures for change detection; community detection for anomaly isolation.
result Simple sequential procedure effectively identifies change-points and anomalous nodes.
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.
Robust quickest change detection method for unknown score functions.
problem Detecting changes in data streams with unknown pre- and post-change distributions.
method Selects least-favorable distributions and robustifies score-based detection algorithm.
result Demonstrates improved performance in simulations.
New algorithm detects changes in Markov kernels with unknown post-change kernel.
problem Detecting changes in Markov kernels with unknown post-change kernel.
method Developed a new change detection algorithm assuming uniform ergodicity.
result Derived upper and lower bounds on mean delay and time between false alarms.
Reduces change detection to estimation using confidence sequences.
problem Detecting changes in data streams with minimal delay and false alarms.
method Reduction from sequential change detection to sequential estimation using confidence sequences.
result Change detection scheme with minimal structural assumptions and strong guarantees.
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.
New method estimates stochastic rate change in insurance portfolios.
problem Determining the stochastic nature of premium changes in dynamic insurance portfolios.
method Definition of rate change as a statistical parameter, various models and techniques for estimation, matched sampling to adjust for policy characteristics.
result Quantification of uncertainty in stochastic rate change estimates, application to motor premium database.
New method detects and locates changes in spatio-temporal point processes.
problem Detecting and localizing changes in spatio-temporal data.
method Score-based, likelihood-free approach estimating change time and region.
result The method provides theoretical guarantees on detection and localization accuracy.
Extends DeTEcT framework for token economies with dynamic and probabilistic parameters.
problem Modeling wealth distribution in token economies with dynamic and probabilistic parameters.
method Introduces four parametrization techniques: dynamic vs static, probabilistic vs non-probabilistic.
result Derives existing wealth distribution models from DeTEcT framework with added restrictions.
This work develops agents to learn generalizable policies for dynamic network environments.
problem Real-world network topologies change due to attackers, defenders, or system failures, leading to failures in adaptive ACD systems.
method Developing agents to learn generalizable policies across dynamic network environments.
result Agents can learn robust policies for dynamic network topologies and diverse attackers.
New algorithm detects changes in Gaussian Process covariance structures.
problem Detecting abrupt changes in Gaussian Process covariance structures.
method Statistical hypothesis tests and Bayesian Online Change Point Detection (BOCPD) with improved thresholds.
result CBOCPD finds multiple structural breaks in GPs even with imprecise hyperparameters.
New method uses topological data analysis for better change point detection.
problem Detecting change points in time series data.
method Integrates topological data analysis with existing nonparametric change point detection methods.
result Enhanced detection accuracy of change point locations.
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.
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.
Balancing graph summarization and change detection in streaming data.
problem Balancing compression rate in graph summarization and accuracy in change detection.
method Introducing a probabilistic hierarchical latent variable model and optimizing parameters based on the minimum description length principle to balance the trade-off.
result Guaranteed suppression of Type I error probability (false alarms) in change detection.
New method detects changes online with bounds on delay.
problem Detecting changes in data streams efficiently.
method Maximizes discrepancy between pre-change and post-change distributions.
result Non-asymptotic bounds on average running length and detection delay.
ABACUS detects changes in multivariate data without labels.
problem Challenging to detect changes in correlated multivariate data.
method Bayesian source separation with multi-level sparsity.
result Competitive or superior performance in simulations and real-world applications.
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.
Deep learning generates efficient change-point detection methods.
problem Detecting change-points in data with various types of change and data behavior.
method Train a neural network to automatically generate detection methods.
result Neural network-based methods are competitive and outperform standard methods in various noise conditions.
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.
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.
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.
A new method detects sparse changes in high-dimensional data streams using tailored PCA projections.
problem Detecting sparse changes in high-dimensional data streams.
method Tailored PCA projections for online change detection.
result High efficiency in detecting even very sparse changes in mean, variance, and correlation.
Novel online graph-based method detects changes in high-dimensional data.
problem Challenges in detecting changes in high-dimensional data.
method Graph-based similarity measure derived from graph-spanning ratio.
result High detection power and controlled false alarm rate for high-dimensional data.
New CUSUM algorithm detects changes in unnormalized models.
problem Change detection in models with unknown normalization constants.
method Score-based CUSUM (SCUSUM) algorithm based on Fisher divergence and Hyvärinen score.
result Asymptotic optimality of the SCUSUM algorithm demonstrated.
Paper detects hierarchical changes in latent variable models from data streams.
problem Detecting changes at three levels: data distribution, latent variables, and number of latent variables.
method Information-theoretic framework using MDL and DNML for change detection.
result Effective in detecting changes with good interpretability.
DE-QT detects optimal Q-learning stopping points.
problem Information loss in Q-learning during prolonged training.
method Introducing DE-QT to detect entropy changes in Q-tables.
result DE-QT identifies the best stopping point for Q-learning.
We address the problem of detecting changes in multivariate datastreams, and we investigate the intrinsic difficulty that change-detection methods have to face when the data dimension scales. In particular, we consider a general approach where changes are detected by comparing the distribution of the log-likelihood of …
Detects changes in signal covariance matrix using extreme eigenvalues.
problem Detects abrupt changes in signal covariance matrix from identity to low-rank.
method Sequential detection based on extreme eigenvalues of sample covariance matrix.
result Effective detection of behavior changes in swarm data.
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 method detects changes without partitioning distributions.
problem Detects changes in unknown probability distributions without partitioning.
method Aggregates e-processes over possible changepoints and infimum over candidate no-change distributions.
result Achieves first-order asymptotically optimal detection delay.
Novel method detects changes in noisy dynamic networks.
problem Change detection in noisy dynamic networks with sparsity and degree heterogeneity.
method Adapted Procrustes analysis to embedded points for vertices in spectral embedding.
result CDP successfully detects various types of vertex-based changes.
CDSSD detects sparse changes in partially observable data streams.
problem Online change detection of sparse changes in partially observable high-dimensional data streams.
method Smooth-sparse decomposition, spike-slab variational Bayesian inference, adaptive sampling via Thompson sampling.
result CDSSD effectively detects sparse changes in partially observable data streams.