Sequential Change Detection through Empirical Distribution and Universal Codes

12/14/2021
by   Vikrant Malik, et al.
0

Universal compression algorithms have been studied in the past for sequential change detection, where they have been used to estimate the post-change distribution in the modified version of the Cumulative Sum (CUSUM) Test. In this paper, we introduce a modified CUSUM test where the pre-change distribution is also unknown and an empirical version of the pre-change distribution is used to implement the algorithm. We present a study of various characteristics of this modified CUSUM Test and then prove its asymptotic optimality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2022

Window-Limited CUSUM for Sequential Change Detection

We study the parametric online changepoint detection problem, where the ...
research
01/15/2018

A Semi-Parametric Binning Approach to Quickest Change Detection

The problem of quickest detection of a change in distribution is conside...
research
03/06/2023

Quickest Change Detection in Statistically Periodic Processes with Unknown Post-Change Distribution

Algorithms are developed for the quickest detection of a change in stati...
research
07/06/2012

Sequential detection of multiple change points in networks: a graphical model approach

We propose a probabilistic formulation that enables sequential detection...
research
05/20/2020

Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions

Sequential probability assignment and universal compression go hand in h...
research
11/19/2018

Model change detection with application to machine learning

Model change detection is studied, in which there are two sets of sample...
research
05/30/2019

Separating an Outlier from a Change

We study the quickest change detection problem with an unknown post-chan...

Please sign up or login with your details

Forgot password? Click here to reset