High-Dimensional Online Change Point Detection with Adaptive Thresholding and Interpretability

TMLR Paper9021 Authors

Abstract:

Change point detection (CPD) identifies abrupt and significant changes in sequential data, with applications in human activity recognition, financial markets, cybersecurity, manufacturing, and autonomous systems. Traditional CPD methods often face computational challenges in high-dimensional settings and typically provide limited explanations for detected changes, which can restrict their practical usability. This paper introduces a CPD framework that improves scalability and interpretability by leveraging the Sliced Wasserstein (SW) distance.
Our contributions are fourfold: (1) we transform multivariate sequential data into one-dimensional scores using the SW distance, making the resulting representation compatible with existing CPD methods; (2) we analyze the distributional behavior of random slices of the SW distance and show that, under suitable assumptions, they can be approximated by a Gamma distribution, providing a principled basis for threshold calibration; (3) we propose a self-adapting online CPD algorithm that combines this SW-based score with an adaptive quantile-based threshold; (4) we introduce a model-specific framework for generating contrastive explanations for annotated change points.
Empirically, our method reduces false positives by at least $48\%$ on average compared with popular online and offline CPD baselines, while maintaining competitive or superior detection performance\footnote{Code is available at \url{https://anonymous.4open.science/r/SWCPD-7022}.}. At the same time, it produces interpretable change-point annotations, making it practical for deployment in high-stakes applications.

Submission Type: Regular submission (no more than 12 pages of main content)

Assigned Action Editor: ~Zhengzhang_Chen1

Submission Number: 9021