Change Detection of Markov Kernels with Unknown Post Change Kernel using Maximum Mean Discrepancy

01/27/2022
by   Hao Chen, et al.
0

In this paper, we develop a new change detection algorithm for detecting a change in the Markov kernel over a metric space in which the post-change kernel is unknown. Under the assumption that the pre- and post-change Markov kernel is geometrically ergodic, we derive an upper bound on the mean delay and a lower bound on the mean time between false alarms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/25/2021

Non-Parametric Quickest Mean Change Detection

The problem of quickest detection of a change in the mean of a sequence ...
research
06/03/2020

Conformal e-prediction for change detection

We adapt conformal e-prediction to change detection, defining analogues ...
research
10/31/2017

Sequential Adaptive Detection for In-Situ Transmission Electron Microscopy (TEM)

We develop new efficient online algorithms for detecting transient spars...
research
10/31/2022

Detecting an Intermittent Change of Unknown Duration

We address the problem of detecting a change that is not persistent but ...
research
02/06/2018

Near-Optimal Coresets of Kernel Density Estimates

We construct near-optimal coresets for kernel density estimate for point...
research
06/08/2023

Robust Quickest Change Detection for Unnormalized Models

Detecting an abrupt and persistent change in the underlying distribution...
research
06/19/2018

Kernel Methods for Nonlinear Connectivity Detection

In this paper, we show that the presence of nonlinear coupling between t...

Please sign up or login with your details

Forgot password? Click here to reset