{"title":"Model-Free Change Point Detection for Mixing Processes","authors":"Hao Chen;Abhishek Gupta;Yin Sun;Ness Shroff","doi":"10.1109/OJCSYS.2024.3398530","DOIUrl":null,"url":null,"abstract":"This paper considers the change point detection problem under dependent samples. In particular, we provide performance guarantees for the MMD-CUSUM test under exponentially \n<inline-formula><tex-math>$\\alpha$</tex-math></inline-formula>\n, \n<inline-formula><tex-math>$\\beta$</tex-math></inline-formula>\n, and fast \n<inline-formula><tex-math>$\\phi$</tex-math></inline-formula>\n-mixing processes, which significantly expands its utility beyond the i.i.d. and Markovian cases used in previous studies. We obtain lower bounds for average-run-length (\n<inline-formula><tex-math>$ {\\mathtt {ARL}}$</tex-math></inline-formula>\n) and upper bounds for average-detection-delay (\n<inline-formula><tex-math>$ {\\mathtt {ADD}}$</tex-math></inline-formula>\n) in terms of the threshold parameter. We show that the MMD-CUSUM test enjoys the same level of performance as the i.i.d. case under fast \n<inline-formula><tex-math>$\\phi$</tex-math></inline-formula>\n-mixing processes. The MMD-CUSUM test also achieves strong performance under exponentially \n<inline-formula><tex-math>$\\alpha$</tex-math></inline-formula>\n/\n<inline-formula><tex-math>$\\beta$</tex-math></inline-formula>\n-mixing processes, which are significantly more relaxed than existing results. The MMD-CUSUM test statistic adapts to different settings without modifications, rendering it a completely data-driven, dependence-agnostic change point detection scheme. Numerical simulations are provided at the end to evaluate our findings.","PeriodicalId":73299,"journal":{"name":"IEEE open journal of control systems","volume":"3 ","pages":"202-213"},"PeriodicalIF":0.0000,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522896","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE open journal of control systems","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10522896/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper considers the change point detection problem under dependent samples. In particular, we provide performance guarantees for the MMD-CUSUM test under exponentially
$\alpha$
,
$\beta$
, and fast
$\phi$
-mixing processes, which significantly expands its utility beyond the i.i.d. and Markovian cases used in previous studies. We obtain lower bounds for average-run-length (
$ {\mathtt {ARL}}$
) and upper bounds for average-detection-delay (
$ {\mathtt {ADD}}$
) in terms of the threshold parameter. We show that the MMD-CUSUM test enjoys the same level of performance as the i.i.d. case under fast
$\phi$
-mixing processes. The MMD-CUSUM test also achieves strong performance under exponentially
$\alpha$
/
$\beta$
-mixing processes, which are significantly more relaxed than existing results. The MMD-CUSUM test statistic adapts to different settings without modifications, rendering it a completely data-driven, dependence-agnostic change point detection scheme. Numerical simulations are provided at the end to evaluate our findings.