In this paper, we formulate and solve a two-stage Bayesian sequential change diagnosis problem. Different from the one-stage sequential change diagnosis problem considered in the existing work, after a change has been detected, we can continue to collect samples so that we can identify the distribution after change more accurately. The goal is to minimize the total cost including delay, false alarm, and mis-diagnosis probabilities. We first convert the two-stage sequential change diagnosis problem into a two-ordered optimal stopping time problem. Using tools from multiple optimal stopping time problems, we obtain the optimal changed detection and distribution identification rules.


Xiaochuan Ma

University of California, Davis

Lifeng Lai

University of California Davis

Shuguang Cui

the Chinese University of Hong Kong, Shenzhen
Private Conversation

Reach out to the speaker privately

Questions & Answers

Post a publicly available question

Questions Asked
I enjoyed your talk. Could you explain the motivation for assuming that c_1 > c_2?
Asked by Venugopal Veeravalli - 1098 on Jun 23, 2020. 1 person subscribed to this question.

No answers yet!

Session Chair

Ali Tajer

Rensselaer Polytechnic Institute