Quickest Change Detection with Leave-one-out Density Estimation
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 1 Nov 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.
- 2025Sequential Change Point Detection via Denoising Score Matchingcited by 3
- 2024Quickest Change Detection with Confusing Changecited by 0
- 2025Sequential Change Point Detection via Denoising Score Matching22 Jan 2025
- 2024Quickest Change Detection with Confusing Change1 May 2024