{"title":"针对依赖性多通道数据的轮循主动序列变化检测","authors":"Anamitra Chaudhuri;Georgios Fellouris;Ali Tajer","doi":"10.1109/TIT.2024.3475394","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of sequentially detecting a change in the joint distribution of multiple data sources under a sampling constraint. Specifically, the channels or sources generate observations that are independent over time, but not necessarily across channels. The joint distribution of an unknown subset of sources changes at an unknown time instant. Moreover, there is a hard constraint that only a fixed number of sources can be sampled at each time instant, but the sources can be selected dynamically based on the already collected data. The goal is to sequentially observe the sources according to the constraint, and stop sampling as quickly as possible after the change while controlling the false alarm rate below a user-specified level. Thus, a policy for this problem consists of a joint sampling and change-detection rule. A non-randomized policy is studied, and an upper bound is established on its worst-case conditional expected detection delay with respect to both the change point and the observations from the affected sources before the change. In certain cases, this rule achieves first-order asymptotic optimality as the false alarm rate tends to zero, simultaneously under every possible post-change distribution and among all schemes that satisfy the same sampling and false alarm constraints. These general results are subsequently applied to the problems of (i) detecting a change in the marginal distributions of (not necessarily independent) information sources, and (ii) detecting a change in the covariance structure of Gaussian information sources.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 12","pages":"9327-9351"},"PeriodicalIF":2.2000,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10707669","citationCount":"0","resultStr":"{\"title\":\"Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data\",\"authors\":\"Anamitra Chaudhuri;Georgios Fellouris;Ali Tajer\",\"doi\":\"10.1109/TIT.2024.3475394\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of sequentially detecting a change in the joint distribution of multiple data sources under a sampling constraint. Specifically, the channels or sources generate observations that are independent over time, but not necessarily across channels. The joint distribution of an unknown subset of sources changes at an unknown time instant. Moreover, there is a hard constraint that only a fixed number of sources can be sampled at each time instant, but the sources can be selected dynamically based on the already collected data. The goal is to sequentially observe the sources according to the constraint, and stop sampling as quickly as possible after the change while controlling the false alarm rate below a user-specified level. Thus, a policy for this problem consists of a joint sampling and change-detection rule. A non-randomized policy is studied, and an upper bound is established on its worst-case conditional expected detection delay with respect to both the change point and the observations from the affected sources before the change. In certain cases, this rule achieves first-order asymptotic optimality as the false alarm rate tends to zero, simultaneously under every possible post-change distribution and among all schemes that satisfy the same sampling and false alarm constraints. These general results are subsequently applied to the problems of (i) detecting a change in the marginal distributions of (not necessarily independent) information sources, and (ii) detecting a change in the covariance structure of Gaussian information sources.\",\"PeriodicalId\":13494,\"journal\":{\"name\":\"IEEE Transactions on Information Theory\",\"volume\":\"70 12\",\"pages\":\"9327-9351\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10707669\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Theory\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10707669/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10707669/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data
This paper considers the problem of sequentially detecting a change in the joint distribution of multiple data sources under a sampling constraint. Specifically, the channels or sources generate observations that are independent over time, but not necessarily across channels. The joint distribution of an unknown subset of sources changes at an unknown time instant. Moreover, there is a hard constraint that only a fixed number of sources can be sampled at each time instant, but the sources can be selected dynamically based on the already collected data. The goal is to sequentially observe the sources according to the constraint, and stop sampling as quickly as possible after the change while controlling the false alarm rate below a user-specified level. Thus, a policy for this problem consists of a joint sampling and change-detection rule. A non-randomized policy is studied, and an upper bound is established on its worst-case conditional expected detection delay with respect to both the change point and the observations from the affected sources before the change. In certain cases, this rule achieves first-order asymptotic optimality as the false alarm rate tends to zero, simultaneously under every possible post-change distribution and among all schemes that satisfy the same sampling and false alarm constraints. These general results are subsequently applied to the problems of (i) detecting a change in the marginal distributions of (not necessarily independent) information sources, and (ii) detecting a change in the covariance structure of Gaussian information sources.
期刊介绍:
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.