skip to content
 

Quickest Changepoint Detection: Optimality Properties of the Shiryaev-Roberts-Type Procedures

Presented by: 
A Tartakovsky University of Connecticut
Date: 
Friday 17th January 2014 - 10:15 to 11:00
Venue: 
INI Seminar Room 1
Abstract: 
We consider a changepoint problem of detecting an abrupt change in a process in a sequential setting when one wants to design a detection procedure that minimizes the average delay to detection of a change subject to constraints on the false alarm rate. A brief overview of the field as well as recent advances will be presented with the focus on a simple scenario where both pre- and post-change distributions are known. Optimality properties of the conventional Shiryaev-Roberts detection procedure and its modifications will be discussed.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons