Abstract

A popular method for detecting changes in the probability distribution of a sequence of observations is CUSUM, which proceeds by sequentially evaluating a log-likelihood ratio test statistic and comparing it to a predefined threshold; a change point is detected as soon as the threshold is exceeded. It is desirable to choose the threshold such that the number of false alarms is kept to a specified level. Traditionally, the number of false alarms is measured by the average run length – the expected stopping time until the first false alarm. However, this is does not in general allow one to control the number of false alarms at every particular time instance. Thus, in this paper two stronger false alarm criteria are considered, for which approximation methods are investigated to facilitate the selection of a threshold.

Highlights

  • False alarm control for change point detection procedures is an important problem in many application domains; see (Tartakovsky et al 2014, Section 1.3)

  • We show that the test statistic of a large class of change point detection procedures can be expressed in form of a first order vector autoregressive process (VAR(1))

  • In this paper we considered two false alarm criteria derived from the maximal local false alarm probability (MLFA)

Read more

Summary

Introduction

False alarm control for change point detection procedures is an important problem in many application domains; see (Tartakovsky et al 2014, Section 1.3). In view of the above, one wishes for further understanding of the distribution of the stopping time as well as simple but effective methods for selecting the threshold such that the probability of raising a false alarm is kept low in a stronger sense than allowed by the ARL criterion. We check that CUSUM (with or without windows) is asymptotically optimal under this modified false alarm criterion, and investigate methods for selecting the threshold such that it is satisfied To do this exactly, one would need closed form expressions for the distribution of the stopping time. In the second part of the paper, we focus on the criterion sup P0(T = n | T ≥ n − 1) ≤ α Note that this implies that the false alarm probability is limited at any given time n.

Problem and Procedures
False Alarm Before Time N
Asymptotic Optimality of CUSUM
Window-Limited Testing
Exact Expression in Terms of Iterated Integrals
Approximation for Threshold Selection
Testing With Expanding Windows
Non-asymptotic Bounds
Approximations for Threshold Selection
More Control over False Alarms
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.