Data-Driven Quickest Change Detection in (Hidden) Markov Models
The paper investigates the problems of quickest change detection in Markov models and hidden Markov models (HMMs). Sequential observations are taken from a (hidden) Markov model. At some unknown time, an event occurs in the system and changes the transition kernel of the Markov model and/or the emission probability of the HMM. The objective is to detect the change quickly, while controlling the average running length (ARL) to false alarm. The data-driven setting is studied, where no knowledge of the pre-, post-change distributions is available. Kernel-based data-driven algorithms are developed, which can be applied in the setting with continuous state, can be updated in a recursive fashion, and are computationally efficient. Lower bounds on the ARL and upper bound on the worst-case average detection delay (WADD) are derived. The WADD is at most of the order of the logarithm of the ARL. The algorithms are further numerically validated on two practical problems of fault detection in DC microgrid and photovoltaic systems.
Code (0)
등록된 구현이 없습니다.
Tasks
Change DetectionFault DetectionSimilar Papers 제목 키워드 기반
Exactly Optimal Bayesian Quickest Change Detection for Hidden Markov Models
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 …
Change DetectionQuickest Change Detection of Time Inconsistent Anticipatory Agents. Human-Sensor and Cyber-Physical Systems
In behavioral economics, human decision makers are modeled as anticipatory agents that make decisions by taking into account the probability of future decisions (plans). We consider cyber-physical systems involving the i…
Change DetectionDecision MakingRobust Score-Based Quickest Change Detection
Methods in the field of quickest change detection rapidly detect in real-time a change in the data-generating distribution of an online data stream. Existing methods have been able to detect this change point when the de…
Change DetectionQuickest Change Detection for Unnormalized Statistical Models
Classical quickest change detection algorithms require modeling pre-change and post-change distributions. Such an approach may not be feasible for various machine learning models because of the complexity of computing th…
Change DetectionQuickest Change Detection in Autoregressive Models
The problem of quickest change detection (QCD) in autoregressive (AR) models is investigated. A system is being monitored with sequentially observed samples. At some unknown time, a disturbance signal occurs and changes …
Change Detection