The Annals of Statistics

On the optimality of Bayesian change-point detection

Dong Han, Fugee Tsung, and Jinguo Xian

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

By introducing suitable loss random variables of detection, we obtain optimal tests in terms of the stopping time or alarm time for Bayesian change-point detection not only for a general prior distribution of change-points but also for observations being a Markov process. Moreover, the optimal (minimal) average detection delay is proved to be equal to $1$ for any (possibly large) average run length to false alarm if the number of possible change-points is finite.

Article information

Source
Ann. Statist., Volume 45, Number 4 (2017), 1375-1402.

Dates
Received: October 2015
Revised: August 2016
First available in Project Euclid: 28 June 2017

Permanent link to this document
https://projecteuclid.org/euclid.aos/1498636860

Digital Object Identifier
doi:10.1214/16-AOS1479

Mathematical Reviews number (MathSciNet)
MR3670182

Zentralblatt MATH identifier
1378.62041

Subjects
Primary: 62L10: Sequential analysis
Secondary: 62L15: Optimal stopping [See also 60G40, 91A60]

Keywords
Optimal test Bayesian change-point detection Markov process

Citation

Han, Dong; Tsung, Fugee; Xian, Jinguo. On the optimality of Bayesian change-point detection. Ann. Statist. 45 (2017), no. 4, 1375--1402. doi:10.1214/16-AOS1479. https://projecteuclid.org/euclid.aos/1498636860


Export citation

References

  • [1] Chow, Y. S., Robbins, H. and Siegmund, D. (1991). The Theory of Optimal Stopping. Dover, New York.
  • [2] Han, D. and Tsung, F. (2004). A generalized EWMA control chart and its comparison with the optimal EWMA, CUSUM and GLR schemes. Ann. Statist. 32 316–339.
  • [3] Han, D., Tsung, F. and Xian, J. (2017). Supplement to “On the optimality of Bayesian change-point detection.” DOI:10.1214/16-AOS1479SUPP.
  • [4] Lawler, G. F. and Limic, V. (2010). Random Walk: A Modern Introduction. Cambridge Studies in Advanced Mathematics 123. Cambridge Univ. Press, Cambridge.
  • [5] Lorden, G. (1971). Procedures for reacting to a change in distribution. Ann. Math. Stat. 42 1897–1908.
  • [6] Moustakides, G. V. (2008). Sequential change detection revisited. Ann. Statist. 36 787–807.
  • [7] Pollak, M. (1985). Optimal detection of a change in distribution. Ann. Statist. 13 206–227.
  • [8] Pollak, M. and Tartakovsky, A. G. (2009). Optimality properties of the Shiryaev–Roberts procedure. Statist. Sinica 19 1729–1739.
  • [9] Polunchenko, A. S. and Tartakovsky, A. G. (2010). On optimality of the Shiryaev–Roberts procedure for detecting a change in distribution. Ann. Statist. 38 3445–3457.
  • [10] Polunchenko, A. S. and Tartakovsky, A. G. (2012). State-of-the-art in sequential change-point detection. Methodol. Comput. Appl. Probab. 14 649–684.
  • [11] Poor, H. V. and Hadjiliadis, O. (2009). Quickest Detection. Cambridge Univ. Press, Cambridge.
  • [12] Roberts, W. S. (1966). A comparison of some control chart procedures. Technometrics 8 411–430.
  • [13] Shiryaev, A. N. (1963). On optimum methods in quickest detection problems. Theory Probab. Appl. 13 22–46.
  • [14] Shiryaev, A. N. and Zryumov, P. Y. (2009). On the linear and nonlinear generalized Bayesian disorder problem (discrete time case). In Optimality and Risk—Modern Trends in Mathematical Finance 227–235. Springer, Berlin.
  • [15] Shiryayev, A. N. (1978). Optimal Stopping Rules. Springer, New York.
  • [16] Tartakovskiĭ, A. G. (2008). Asymptotic optimality in Bayesian quickest detection problems under a global false alarm probability constraint. Theory Probab. Appl. 53 443–466.
  • [17] Tartakovsky, A., Nikiforov, I. and Basseville, M. (2015). Sequential Analysis: Hypothesis Testing and Changepoint Detection. Monographs on Statistics and Applied Probability 136. CRC Press, Boca Raton, FL.
  • [18] Tartakovsky, A. G., Pollak, M. and Polunchenko, A. S. (2012). Third-order asymptotic optimality of the generalized Shiryaev–Roberts changepoint detection procedures. Theory Probab. Appl. 56 457–484.
  • [19] Tartakovsky, A. G. and Veeravalli, V. V. (2005). General asymptotic Bayesian theory of quickest change detection. Theory Probab. Appl. 49 458–497.
  • [20] Yakir, B. (1994). Optimal detection of a change in distribution when the observations form a Markov chain with a finite state space. In Change-Point Problems (South Hadley, MA, 1992) (E. Carlstein, H. Muller and D. Siegmund, eds.). Institute of Mathematical Statistics Lecture Notes—Monograph Series 23 346–358. IMS, Hayward, CA.

Supplemental materials

  • Supplement A: Proofs of Theorem 4 of the paper “On the optimality of Bayesian change-point detection”. We prove in the supplementary material that the optimal (minimal) average detection delay is equal to 1 for any (possibly large) average run length to false alarm if the number of possible change-points is finite for observations being a Markov process.