A Contrastive Approach to Online Change Point Detection

06/21/2022
by   Nikita Puchkin, et al.
0

We suggest a novel procedure for online change point detection. Our approach expands an idea of maximizing a discrepancy measure between points from pre-change and post-change distributions. This leads to a flexible procedure suitable for both parametric and nonparametric scenarios. We prove non-asymptotic bounds on the average running length of the procedure and its expected detection delay. The efficiency of the algorithm is illustrated with numerical experiments on synthetic and real-world data sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2022

Deep learning model solves change point detection for multiple change types

A change points detection aims to catch an abrupt disorder in data distr...
research
10/31/2022

Data-Adaptive Symmetric CUSUM for Sequential Change Detection

Detecting change points sequentially in a streaming setting, especially ...
research
02/07/2020

Unsupervised non-parametric change point detection in quasi-periodic signals

We propose a new unsupervised and non-parametric method to detect change...
research
01/08/2023

Online Centralized Non-parametric Change-point Detection via Graph-based Likelihood-ratio Estimation

Consider each node of a graph to be generating a data stream that is syn...
research
06/27/2023

Multilayer random dot product graphs: Estimation and online change point detection

We study the multilayer random dot product graph (MRDPG) model, an exten...
research
01/26/2022

Online Change Point Detection for Weighted and Directed Random Dot Product Graphs

Given a sequence of random (directed and weighted) graphs, we address th...
research
08/07/2018

Fluctuation bounds for continuous time branching processes and nonparametric change point detection in growing networks

Motivated by applications, both for modeling real world systems as well ...

Please sign up or login with your details

Forgot password? Click here to reset