Quickest Change Detection with Leave-one-out Density Estimation
The problem of quickest change detection in a sequence of independent observations is considered. The pre-change distribution is assumed to be known, while the post-change distribution is completely unknown. A window-limited leave-one-out (LOO) CuSum test is developed, which does not assume any knowledge of the post-change distribution, and does not require any post-change training samples. It is shown that, with certain convergence conditions on the density estimator, the LOO-CuSum test is first-order asymptotically optimal, as the false alarm rate goes to zero. The analysis is validated through numerical results, where the LOO-CuSum test is compared with baseline tests that have distributional knowledge.
Code (0)
등록된 구현이 없습니다.
Tasks
Change DetectionDensity EstimationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Quickest 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 DetectionBayesian Quickest Change Detection of an Intruder in Acknowledgments for Private Remote State Estimation
For geographically separated cyber-physical systems, state estimation at a remote monitoring or control site is important to ensure stability and reliability of the system. Often for safety or commercial reasons it is ne…
Change DetectionState EstimationQuickest 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 DetectionConditional 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 $\nabla_{\mathbf{y}} \log p(\mathbf{y}|\mathbf{x})$ directly from sa…
Change Detection