paper-with-me

홈 › Papers

Misspecified and Asymptotically Minimax Robust Quickest Change Diagnosis

2020-04-21

The problem of quickly diagnosing an unknown change in a stochastic process is studied. We establish novel bounds on the performance of misspecified diagnosis algorithms designed for changes that differ from those of the process, and pose and solve a new robust quickest change diagnosis problem in the asymptotic regime of few false alarms and false isolations. Simulations suggest that our asymptotically robust solution offers a computationally efficient alternative to generalised likelihood ratio algorithms.

📄 PDF Abstract BibTeX arXiv:2004.09748

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Non-Parametric Quickest Mean Change Detection

2021-08-25 · Yuchen Liang, Venugopal V. Veeravalli

The problem of quickest detection of a change in the mean of a sequence of independent observations is studied. The pre-change distribution is assumed to be stationary, while the post-change distributions are allowed to …

Change Detection

Asymptotically optimal sequential change detection for bounded means

2026-02-05 · Ashwin Ram, Aaditya Ramdas arxiv

We consider the problem of quickest changepoint detection under the Average Run Length (ARL) constraint where the pre-change and post-change laws lie in composite families $\mathscr{P}$ and $\mathscr{Q}$ respectively. In…

Change Detection

Quickest Change Detection with Leave-one-out Density Estimation

2022-11-01 · Yuchen Liang, Venugopal V. Veeravalli

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-lim…

Change DetectionDensity Estimation

Quickest Change Detection with Non-Stationary Post-Change Observations

2021-10-04 · Yuchen Liang, Alexander G. Tartakovsky, Venugopal V. Veeravalli

The problem of quickest detection of a change in the distribution of a sequence of independent observations is considered. The pre-change observations are assumed to be stationary with a known distribution, while the pos…

Change Detection

Quickest change detection for multi-task problems under unknown parameters

2021-01-01 · Firas Jarboui, Vianney Perchet

We consider the quickest change detection problem where both the parameters of pre- and post- change distributions are unknown, which prevent the use of classical simple hypothesis testing. Without additional assumptions…

Change DetectionTwo-sample testing