Robust Sequential Change Detection: The Approach Based on Breakdown Points and Influence Functions

IF 2.2 3区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ruizhi Zhang
{"title":"Robust Sequential Change Detection: The Approach Based on Breakdown Points and Influence Functions","authors":"Ruizhi Zhang","doi":"10.1109/TIT.2025.3565748","DOIUrl":null,"url":null,"abstract":"Sequential change-point detection has many important applications in industrial quality control, signal detection, and clinical trials. However, many classical procedures may fail when the observed data are contaminated by outliers, even if the percentage of outliers is very small. In this paper, we focus on the problem of robust sequential change-point detection in the presence of a small proportion of random outliers. We first study the statistical detection properties of a general family of detection procedures under Huber’s gross error model. Moreover, we incorporate ideas of the breakdown point and the influence function from the classical offline robust statistics literature and propose their new definitions to quantify the robustness of general sequential change-point detection procedures. Then, we derive the breakdown points and influence functions of our proposed family of detection procedures, which provide a quantitative analysis of the robustness of these procedures. Moreover, we find the optimal robust bounded-influence procedure in that general family that has the smallest detection delay subject to the constraints on the false alarm rate influence function. It turns out the optimal procedure is based on truncation of the scaled likelihood ratio statistic and has a simple form. Finally, we demonstrate the robustness and the detection efficiency of the optimal robust bounded-influence procedure through extensive simulations and compute numerical approximations of breakdown points and influence functions of some procedures to have a quantitative understanding of the robustness of different procedures.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 7","pages":"5620-5632"},"PeriodicalIF":2.2000,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10981318/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Sequential change-point detection has many important applications in industrial quality control, signal detection, and clinical trials. However, many classical procedures may fail when the observed data are contaminated by outliers, even if the percentage of outliers is very small. In this paper, we focus on the problem of robust sequential change-point detection in the presence of a small proportion of random outliers. We first study the statistical detection properties of a general family of detection procedures under Huber’s gross error model. Moreover, we incorporate ideas of the breakdown point and the influence function from the classical offline robust statistics literature and propose their new definitions to quantify the robustness of general sequential change-point detection procedures. Then, we derive the breakdown points and influence functions of our proposed family of detection procedures, which provide a quantitative analysis of the robustness of these procedures. Moreover, we find the optimal robust bounded-influence procedure in that general family that has the smallest detection delay subject to the constraints on the false alarm rate influence function. It turns out the optimal procedure is based on truncation of the scaled likelihood ratio statistic and has a simple form. Finally, we demonstrate the robustness and the detection efficiency of the optimal robust bounded-influence procedure through extensive simulations and compute numerical approximations of breakdown points and influence functions of some procedures to have a quantitative understanding of the robustness of different procedures.
鲁棒序列变化检测:基于故障点和影响函数的方法
顺序变化点检测在工业质量控制、信号检测和临床试验中有许多重要的应用。然而,当观测数据被异常值污染时,即使异常值的百分比很小,许多经典方法也可能失败。在本文中,我们重点研究了存在少量随机异常值的鲁棒序列变化点检测问题。我们首先研究了Huber粗误差模型下一般检测程序族的统计检测特性。此外,我们结合了经典离线鲁棒统计文献中的击穿点和影响函数的思想,并提出了它们的新定义,以量化一般顺序变化点检测程序的鲁棒性。然后,我们推导出了我们所提出的检测程序族的故障点和影响函数,从而对这些程序的鲁棒性进行了定量分析。此外,在虚警率影响函数的约束下,我们在检测延迟最小的一般族中找到了最优鲁棒有界影响过程。结果表明,优化过程是基于对标度似然比统计量的截断,且形式简单。最后,我们通过大量的仿真证明了最优鲁棒有界影响过程的鲁棒性和检测效率,并计算了一些过程的击穿点和影响函数的数值近似,以定量地了解不同过程的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory 工程技术-工程:电子与电气
CiteScore
5.70
自引率
20.00%
发文量
514
审稿时长
12 months
期刊介绍: The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信