Quickest Change Detection with Mismatched Post-Change Models
Jingxian Wu, Jing Yang

TL;DR
This paper analyzes how mismatched post-change models affect the performance of classical quickest change detection procedures, providing bounds and insights into the degradation caused by model inaccuracies.
Contribution
It offers an analytical characterization of the impact of post-change model mismatch on CUSUM and Shiryaev-Roberts procedures, including performance bounds and degradation rates.
Findings
Mismatch increases average detection delay (ADD).
Degradation depends on the difference between KL divergences.
Performance bounds are derived for ARL, PFA, and ADD.
Abstract
In this paper, we study the quickest change detection with mismatched post-change models. A change point is the time instant at which the distribution of a random process changes. The objective of quickest change detection is to minimize the detection delay of an unknown change point under certain performance constraints, such as average run length (ARL) to false alarm or probability of false alarm (PFA). Most existing change detection procedures assume perfect knowledge of the random process distributions before and after the change point. However, in many practical applications such as anomaly detection, the post-change distribution is often unknown and needs to be estimated with a limited number of samples. In this paper, we study the case that there is a mismatch between the true post-change distribution and the one used during detection. We analytically identify the impacts of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Statistical Process Monitoring · Statistical Methods and Inference · Statistical Methods in Clinical Trials
