Change Detection of Markov Kernels with Unknown Pre and Post Change Kernel
arXiv:2201.11722 · doi:10.1109/CDC51059.2022.9992982
Abstract
In this paper, we develop a new change detection algorithm for detecting a change in the Markov kernel over a metric space in which the post-change kernel is unknown. Under the assumption that the pre- and post-change Markov kernel is uniformly ergodic, we derive an upper bound on the mean delay and a lower bound on the mean time between false alarms. A numerical simulation is provided to demonstrate the effectiveness of our method.
arXiv comment7 pages, 4 figures
References in corpus (7)
- Basic Properties of Strong Mixing Conditions. A Survey and Some Open Questions
- Kernel Mean Embedding of Distributions: A Review and Beyond
- Learning Decentralized Controllers for Robot Swarms with Graph Neural Networks
- Hilbert space embeddings and metrics on probability measures
- Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence
- B-tests: Low Variance Kernel Two-Sample Tests
- A Dynamic Watermarking Algorithm for Finite Markov Decision Problems