Anomaly Search over Composite Hypotheses in Hierarchical Statistical Models
Benjamin Wolff, Tomer Gafni, Guy Revach, Nir Shlezinger, Kobi Cohen

TL;DR
This paper introduces Hierarchical Dynamic Search (HDS), a sequential anomaly detection method in hierarchical models that is order-optimal, asymptotically optimal, and effective in real-world cybersecurity datasets.
Contribution
The paper proposes HDS, a novel hierarchical search strategy using GLLR statistics, optimized for composite hypotheses and multiple anomalies detection.
Findings
HDS is order-optimal in search space
HDS is asymptotically optimal for detection accuracy
HDS outperforms existing methods on DARPA dataset
Abstract
Detection of anomalies among a large number of processes is a fundamental task that has been studied in multiple research areas, with diverse applications spanning from spectrum access to cyber-security. Anomalous events are characterized by deviations in data distributions, and thus can be inferred from noisy observations based on statistical methods. In some scenarios, one can often obtain noisy observations aggregated from a chosen subset of processes. Such hierarchical search can further minimize the sample complexity while retaining accuracy. An anomaly search strategy should thus be designed based on multiple requirements, such as maximizing the detection accuracy; efficiency, be efficient in terms of sample complexity; and be able to cope with statistical models that are known only up to some missing parameters (i.e., composite hypotheses). In this paper, we consider anomaly…
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.
Taxonomy
TopicsAnomaly Detection Techniques and Applications · Artificial Immune Systems Applications · Network Security and Intrusion Detection
