Optimal Sub-sampling to Boost Power of Kernel Sequential Change-point Detection

10/26/2022
by   Song Wei, et al.
0

We present a novel scheme to boost detection power for kernel maximum mean discrepancy based sequential change-point detection procedures. Our proposed scheme features an optimal sub-sampling of the history data before the detection procedure, in order to tackle the power loss incurred by the random sub-sample from the enormous history data. We apply our proposed scheme to both Scan B and Kernel Cumulative Sum (CUSUM) procedures, and improved performance is observed from extensive numerical experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2022

Online Kernel CUSUM for Change-Point Detection

We develop an online kernel Cumulative Sum (CUSUM) procedure, which cons...
research
12/18/2019

Sequential change point tests based on U-statistics

We propose a general framework of sequential testing procedures based on...
research
07/15/2022

A Broad and General Sequential Sampling Scheme

In this paper, we propose a broad and general sequential sampling scheme...
research
10/21/2020

Network topology change-point detection from graph signals with prior spectral signatures

We consider the problem of sequential graph topology change-point detect...
research
06/21/2019

LPD Communication: A Sequential Change-Point Detection Perspective

In this paper, we establish a framework for low probability of detection...
research
03/06/2019

Nonparametric Change Point Detection in Regression

This paper considers an important problem of change-point detection in r...
research
11/22/2022

Online Detection Of Supply Chain Network Disruptions Using Sequential Change-Point Detection for Hawkes Processes

In this paper, we attempt to detect an inflection or change-point result...

Please sign up or login with your details

Forgot password? Click here to reset