MULTIPLE OPTIMALITY PROPERTIES OF THE SHEWHART TEST

Abstract

Abstract Abstract For the problem of sequential detection of changes, we adopt the probability maximizing approach in place of the classical minimization of the average detection delay and propose modified versions of the Shiryaev, Lorden, and Pollak performance measures. For these alternative formulations, we demonstrate that the optimum sequential detection scheme is the simple Shewhart rule. Interestingly, we can also solve problems that under the classical setup have been open for many years, as optimum change detection with time-varying observations or with multiple postchange probability measures. For the latter, we also offer the exact solution for Lorden's original setup involving average detection delays, for the case where the average false alarm period is within certain limits. Keywords: Change detectionSequential detectionShewhart testSubject Classifications: 62L1560G4062F1262F15

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 40 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.