University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Quickest Changepoint Detection: Optimality Properties of the Shiryaev-Roberts-Type Procedures

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

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Inference for Change-Point and Related Processes

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity