The Annals of Statistics
- Ann. Statist.
- Volume 26, Number 6 (1998), 2179-2205.
Quickest detection with exponential penalty for delay
The problem of detecting a change in the probability distribution of a random sequence is considered. Stopping times are derived that optimize the tradeoff between detection delay and false alarms within two criteria. In both cases, the detection delay is penalized exponentially rather than linearly, as has been the case in previous formulations of this problem. The first of these two criteria is to minimize a worst-case measure of the exponential detection delay within a lower-bound constraint on the mean time between false alarms. Expressions for the performance of the optimal detection rule are also developed for this case. It is seen, for example, that the classical Page CUSUM test can be arbitrarily unfavorable relative to the optimal test under exponential delay penalty. The second criterion considered is a Bayesian one, in which the unknown change point is assumed to obey a geometric prior distribution. In this case, the optimal stopping time effects an optimal trade-off between the expected exponential detection delay and the probability of false alarm. Finally, generalizations of these results to problems in which the penalties for delay may be path dependent are also considered.
Ann. Statist., Volume 26, Number 6 (1998), 2179-2205.
First available in Project Euclid: 21 June 2002
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Poor, H. Vincent. Quickest detection with exponential penalty for delay. Ann. Statist. 26 (1998), no. 6, 2179--2205. doi:10.1214/aos/1024691466. https://projecteuclid.org/euclid.aos/1024691466