Misspecified and Asymptotically Minimax Robust Quickest Change Diagnosis

04/21/2020
by   Timothy L. Molloy, et al.
0

The problem of quickly diagnosing an unknown change in a stochastic process is studied. We establish novel bounds on the performance of misspecified diagnosis algorithms designed for changes that differ from those of the process, and pose and solve a new robust quickest change diagnosis problem in the asymptotic regime of few false alarms and false isolations. Simulations suggest that our asymptotically robust solution offers a computationally efficient alternative to generalised likelihood ratio algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/23/2022

Sequential Change Diagnosis Revisited and the Adaptive Matrix CuSum

The problem of sequential change diagnosis is considered, where observat...
research
06/03/2020

Conformal e-prediction for change detection

We adapt conformal e-prediction to change detection, defining analogues ...
research
09/18/2020

Quickest Change Detection with Privacy Constraint

This paper considers Lorden's minimax quickest change detection (QCD) pr...
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
03/04/2023

Modeling and Quickest Detection of a Rapidly Approaching Object

The problem of detecting the presence of a signal that can lead to a dis...
research
08/11/2021

Minimax and pointwise sequential changepoint detection and identification for general stochastic models

This paper considers the problem of joint change detection and identific...
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