Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 2006 | Published
Journal Article Open

Sequential change-point detection when unknown parameters are present in the pre-change distribution

Mei, Yajun

Abstract

In the sequential change-point detection literature, most research specifies a required frequency of false alarms at a given pre-change distribution f_θ and tries to minimize the detection delay for every possible post-change distribution g_λ. In this paper, motivated by a number of practical examples, we first consider the reverse question by specifying a required detection delay at a given post-change distribution and trying to minimize the frequency of false alarms for every possible pre-change distribution f_θ. We present asymptotically optimal procedures for one-parameter exponential families. Next, we develop a general theory for change-point problems when both the pre-change distribution f_θ and the post-change distribution g_λ involve unknown parameters. We also apply our approach to the special case of detecting shifts in the mean of independent normal observations.

Additional Information

© 2006 Institute of Mathematical Statistics. Received February 2004; revised February 2005. Supported in part by NIH Grant R01 AI055343. This work is part of my Ph.D. dissertation at the California Institute of Technology. I would like to thank my thesis advisor, Professor Gary Lorden, for his constant support and encouragement and Professor Moshe Pollak for sharing his insightful ideas. Thanks also to Professor Sarah Holte, Professor Jon A. Wellner, the Associate Editor and the referees for their helpful remarks.

Attached Files

Published - MEIaos06.pdf

Files

MEIaos06.pdf
Files (279.4 kB)
Name Size Download all
md5:06c2b48a327e1dfbf931f6a0bb233a4a
279.4 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 23, 2023