Exactly optimal Bayesian quickest change detection for hidden Markov models
From MaRDI portal
Abstract: This paper considers the quickest detection problem for hidden Markov models (HMMs) in a Bayesian setting. We construct an augmented HMM representation of the problem that allows the application of a dynamic programming approach to prove that Shiryaev's rule is an (exact) optimal solution. This augmented representation highlights the problem's fundamental information structure and suggests possible relaxations to more exotic change event priors not appearing in the literature. Finally, this augmented representation also allows us to present an efficient computational method for implementing the optimal solution.
Cites work
- A Bayesian Theory of Change Detection in Statistically Periodic Random Processes
- Asymptotic Bayesian Theory of Quickest Change Detection for Hidden Markov Models
- Data-efficient quickest change detection with on-off observation control
- Detection of abrupt changes: theory and application
- Dynamic programming and optimal control. Vol. 1.
- General Asymptotic Bayesian Theory of Quickest Change Detection
- scientific article; zbMATH DE number 722978 (Why is no real title available?)
- scientific article; zbMATH DE number 1487663 (Why is no real title available?)
- Optimal Stopping Rules
- Partially observed Markov decision processes. From filtering to controlled sensing
- Sequential Detection and Identification of a Change in the Distribution of a Markov-Modulated Random Sequence
Cited in
(3)
This page was built for publication: Exactly optimal Bayesian quickest change detection for hidden Markov models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6073031)