Searching for Anomalies over Composite Hypotheses
Bar Hemo, Tomer Gafni, Kobi Cohen, Qing Zhao

TL;DR
This paper introduces an asymptotically optimal sequential search algorithm for anomaly detection in multiple processes under composite hypotheses, with proven performance bounds and extensive experimental validation.
Contribution
It develops a deterministic, asymptotically optimal search algorithm for composite hypothesis anomaly detection, handling unknown parameters and providing finite-sample error bounds.
Findings
Algorithm achieves asymptotic optimality in detection delay.
Proven finite-sample error probability bounds.
Strong empirical performance on synthetic and real datasets.
Abstract
The problem of detecting anomalies in multiple processes is considered. We consider a composite hypothesis case, in which the measurements drawn when observing a process follow a common distribution with an unknown parameter (vector), whose value lies in normal or abnormal parameter spaces, depending on its state. The objective is a sequential search strategy that minimizes the expected detection time subject to an error probability constraint. We develop a deterministic search algorithm with the following desired properties. First, when no additional side information on the process states is known, the proposed algorithm is asymptotically optimal in terms of minimizing the detection delay as the error probability approaches zero. Second, when the parameter value under the null hypothesis is known and equal for all normal processes, the proposed algorithm is asymptotically optimal as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
