On Matched Filtering for Statistical Change Point Detection
- URL: http://arxiv.org/abs/2006.05539v4
- Date: Tue, 27 Oct 2020 21:00:52 GMT
- Title: On Matched Filtering for Statistical Change Point Detection
- Authors: Kevin C. Cheng, Eric L. Miller, Michael C. Hughes, Shuchin Aeron
- Abstract summary: Non-parametric randomness and distribution-free two-sample tests have been the foundation of many change point detection algorithms.
We address these issues by deriving and applying filters matched to the expected temporal signatures of a change.
Our method allows for the localization of change points without the use of ad-hoc post-processing.
- Score: 13.64446865914411
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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 allows
the filtered signal produced by our methods to maintain expected statistical
significance. Through experiments on synthetic data as well as activity
recognition benchmarks, we demonstrate the utility of this approach for
mitigating false positives and improving the test precision. Our method allows
for the localization of change points without the use of ad-hoc post-processing
to remove redundant detections common to current methods. We further highlight
the performance of statistical tests based on the Quantile-Quantile (Q-Q)
function and show how the invariance property of the Q-Q function to
order-preserving transformations allows these tests to detect change points of
different scales with a single threshold within the same dataset.
Related papers
- Uncertainty-Calibrated Test-Time Model Adaptation without Forgetting [55.17761802332469]
Test-time adaptation (TTA) seeks to tackle potential distribution shifts between training and test data by adapting a given model w.r.t. any test sample.
Prior methods perform backpropagation for each test sample, resulting in unbearable optimization costs to many applications.
We propose an Efficient Anti-Forgetting Test-Time Adaptation (EATA) method which develops an active sample selection criterion to identify reliable and non-redundant samples.
arXiv Detail & Related papers (2024-03-18T05:49:45Z) - Change Point Detection with Copula Entropy based Two-Sample Test [1.7125489646780319]
Change point detection is a typical task that aim to find changes in time series and can be tackled with two-sample test.
Copula Entropy is a mathematical concept for measuring statistical independence and a two-sample test based on it was introduced recently.
We propose a nonparametric multivariate method for multiple change point detection with the copula entropy-based two-sample test.
arXiv Detail & Related papers (2024-02-03T20:36:48Z) - Domain Adaptive Synapse Detection with Weak Point Annotations [63.97144211520869]
We present AdaSyn, a framework for domain adaptive synapse detection with weak point annotations.
In the WASPSYN challenge at I SBI 2023, our method ranks the 1st place.
arXiv Detail & Related papers (2023-08-31T05:05:53Z) - Discriminative calibration: Check Bayesian computation from simulations
and flexible classifier [23.91355980551754]
We propose to replace the marginal rank test with a flexible classification approach that learns test statistics from data.
We illustrate an automated implementation using neural networks and statistically-inspired features, and validate the method with numerical and real data experiments.
arXiv Detail & Related papers (2023-05-24T00:18:48Z) - Bootstrapped Edge Count Tests for Nonparametric Two-Sample Inference
Under Heterogeneity [5.8010446129208155]
We develop a new nonparametric testing procedure that accurately detects differences between the two samples.
A comprehensive simulation study and an application to detecting user behaviors in online games demonstrates the excellent non-asymptotic performance of the proposed test.
arXiv Detail & Related papers (2023-04-26T22:25:44Z) - Nonparametric Conditional Local Independence Testing [69.31200003384122]
Conditional local independence is an independence relation among continuous time processes.
No nonparametric test of conditional local independence has been available.
We propose such a nonparametric test based on double machine learning.
arXiv Detail & Related papers (2022-03-25T10:31:02Z) - E-detectors: a nonparametric framework for sequential change detection [86.15115654324488]
We develop a fundamentally new and general framework for sequential change detection.
Our procedures come with clean, nonasymptotic bounds on the average run length.
We show how to design their mixtures in order to achieve both statistical and computational efficiency.
arXiv Detail & Related papers (2022-03-07T17:25:02Z) - Feature Shift Detection: Localizing Which Features Have Shifted via
Conditional Distribution Tests [12.468665026043382]
In military sensor networks, users will want to detect when one or more of the sensors has been compromised.
We first define a formalization of this problem as multiple conditional distribution hypothesis tests.
For both efficiency and flexibility, we propose a test statistic based on the density model score function.
arXiv Detail & Related papers (2021-07-14T18:23:24Z) - Testing for Outliers with Conformal p-values [14.158078752410182]
The goal is to test whether new independent samples belong to the same distribution as a reference data set or are outliers.
We propose a solution based on conformal inference, a broadly applicable framework which yields p-values that are marginally valid but mutually dependent for different test points.
We prove these p-values are positively dependent and enable exact false discovery rate control, although in a relatively weak marginal sense.
arXiv Detail & Related papers (2021-04-16T17:59:21Z) - Uncertainty Inspired RGB-D Saliency Detection [70.50583438784571]
We propose the first framework to employ uncertainty for RGB-D saliency detection by learning from the data labeling process.
Inspired by the saliency data labeling process, we propose a generative architecture to achieve probabilistic RGB-D saliency detection.
Results on six challenging RGB-D benchmark datasets show our approach's superior performance in learning the distribution of saliency maps.
arXiv Detail & Related papers (2020-09-07T13:01:45Z) - 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.