TY - JOUR
T1 - Non-Parametric Quickest Mean-Change Detection
AU - Liang, Yuchen
AU - Veeravalli, Venugopal V.
N1 - This work was supported in part by the National Science Foundation under Grant ECCS-2033900 and in part by the Army Research Laboratory through the University of Illinois at Urbana-Champaign under Grant W911NF-17-2-0196.
PY - 2022/12/1
Y1 - 2022/12/1
N2 - The problem of quickest detection of a change in the mean of a sequence of independent observations is studied. The pre-change observations are assumed to be stationary, while the post-change observations are allowed to be non-stationary. The case where the pre-change distribution is known is studied first, and then the extension where only the mean and variance of the pre-change distribution are known. No knowledge of the post-change distributions is assumed other than that the means of the observations are above some pre-specified threshold larger than the pre-change mean. For the case where the pre-change distribution is known, a test is derived that asymptotically minimizes the worst-case detection delay over all possible post-change distributions, as the false alarm rate goes to zero. Towards deriving this asymptotically optimal test, some new results are provided for the general problem of asymptotic minimax robust quickest change detection in non-stationary settings. Then, the limiting form of the optimal test is studied as the gap between the pre- and post-change means goes to zero, called the Mean-Change Test (MCT). It is shown that the MCT can be designed with only knowledge of the mean and variance of the pre-change distribution. The performance of the MCT is also characterized when the mean gap is moderate, under the additional assumption that the distributions of the observations have bounded support. The analysis is validated through numerical results for detecting a change in the mean of a beta distribution. The use of the MCT in monitoring pandemics is also demonstrated.
AB - The problem of quickest detection of a change in the mean of a sequence of independent observations is studied. The pre-change observations are assumed to be stationary, while the post-change observations are allowed to be non-stationary. The case where the pre-change distribution is known is studied first, and then the extension where only the mean and variance of the pre-change distribution are known. No knowledge of the post-change distributions is assumed other than that the means of the observations are above some pre-specified threshold larger than the pre-change mean. For the case where the pre-change distribution is known, a test is derived that asymptotically minimizes the worst-case detection delay over all possible post-change distributions, as the false alarm rate goes to zero. Towards deriving this asymptotically optimal test, some new results are provided for the general problem of asymptotic minimax robust quickest change detection in non-stationary settings. Then, the limiting form of the optimal test is studied as the gap between the pre- and post-change means goes to zero, called the Mean-Change Test (MCT). It is shown that the MCT can be designed with only knowledge of the mean and variance of the pre-change distribution. The performance of the MCT is also characterized when the mean gap is moderate, under the additional assumption that the distributions of the observations have bounded support. The analysis is validated through numerical results for detecting a change in the mean of a beta distribution. The use of the MCT in monitoring pandemics is also demonstrated.
KW - Quickest change detection (QCD)
KW - minimax robust detection
KW - non-parametric methods
KW - non-stationary observations
UR - http://www.scopus.com/inward/record.url?scp=85135242421&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85135242421&partnerID=8YFLogxK
U2 - 10.1109/TIT.2022.3191957
DO - 10.1109/TIT.2022.3191957
M3 - Article
AN - SCOPUS:85135242421
SN - 0018-9448
VL - 68
SP - 8040
EP - 8052
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 12
ER -