Conditional Score Learning for Quickest Change Detection in Markov Transition Kernels

We address the problem of quickest change detection in Markov processes with unknown transition kernels. The key idea is to learn the conditional score ∇y log p(y∣x) directly from sample pairs (x, y), where both x and y are high-dimensional data generated by the same transition kernel. In this way, we avoid explicit likelihood evaluation and provide a practical way to learn the transition dynamics. Based on this estimation, we develop a score-based CUSUM procedure that uses conditional Hyvärinen score differences to detect changes in the kernel. To ensure bounded increments, we propose a truncated version of the statistic. With Hoeffding’s inequality for uniformly ergodic Markov processes, we prove exponential lower bounds on the mean time to false alarm. We also prove asymptotic upper bounds on detection delay. These results give both theoretical guarantees and practical feasibility for score-based detection in high-dimensional Markov models.

Duke Scholars

Author Vahid Tarokh Pierre R. Lamond Department of Electrical and Computer Engin ...