On Matched Filtering for Statistical Change Point Detection
Kevin C. Cheng, Eric L. Miller, Michael C. Hughes, Shuchin Aeron

TL;DR
This paper introduces matched filtering techniques for non-parametric change point detection, enhancing accuracy and reducing false positives by leveraging expected temporal signatures of changes in various statistical tests.
Contribution
It derives asymptotic matched filters for multiple two-sample tests, enabling distribution-free, peak-preserving detection of change points without ad-hoc post-processing.
Findings
Matched filters improve change point localization accuracy.
The approach reduces false positives in synthetic and real data.
It enables detection of change points across different scales with a single threshold.
Abstract
Non-parametric and distribution-free two-sample tests have been the foundation of many change point detection algorithms. However, randomness in the test statistic as a function of time makes them susceptible to false positives and localization ambiguity. We address these issues by deriving and applying filters matched to the expected temporal signatures of a change for various sliding window, two-sample tests under IID assumptions on the data. These filters are derived asymptotically with respect to the window size for the Wasserstein quantile test, the Wasserstein-1 distance test, Maximum Mean Discrepancy squared (MMD^2), and the Kolmogorov-Smirnov (KS) test. The matched filters are shown to have two important properties. First, they are distribution-free, and thus can be applied without prior knowledge of the underlying data distributions. Second, they are peak-preserving, which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
