On Optimality Properties of the Shiryaev-Roberts Procedure

Abstract

We consider the simple changepoint problem setting, where observations are independent, iid pre-change and iid post-change, with known pre- and post-change distributions. The Shiryaev-Roberts detection procedure is known to be asymptotically minimax in the sense of minimizing maximal expected detection delay subject to a bound on the average run length to false alarm, as the latter goes to infinity. Here we present other optimality properties of the Shiryaev-Roberts procedure.

12

Cited by in corpus (12)

• Efficient Computer Network Anomaly Detection by Changepoint Detection Methods
• State-of-the-Art in Sequential Change-Point Detection
• On optimality of the Shiryaev-Roberts procedure for detecting a change in distribution
• Numerical Comparison of Cusum and Shiryaev-Roberts Procedures for Detecting Changes in Distributions
• Quickest Change-Point Detection: A Bird's Eye View
• Model-Free Change Point Detection for Mixing Processes
• Bayesian Models Applied to Cyber Security Anomaly Detection Problems
• An Accurate Method for Determining the Pre-Change Run-Length Distribution of the Generalized Shiryaev--Roberts Detection Procedure
• Efficient Performance Evaluation of the Generalized Shiryaev--Roberts Detection Procedure in a Multi-Cyclic Setup
• On Control Charts for Monitoring the Variance of a Time Series
• Sequential Multiple Structural Damage Detection and Localization: A Distributed Approach
• Asymptotic Exponentiality of the First Exit Time of the Shiryaev-Roberts Diffusion with Constant Positive Drift