Composite Anomaly Detection via Hierarchical Dynamic Search.

Benjamin Wolff, Tomer Gafni, Guy Revach, Nir Shlezinger, Kobi Cohen

Research output: Working paper/PreprintPreprint


Anomaly detection among a large number of processes arises in many applications ranging from dynamic spectrum access to cybersecurity. In such problems one can often obtain noisy observations aggregated from a chosen subset of processes that conforms to a tree structure. The distribution of these observations, based on which the presence of anomalies is detected, may be only partially known. This gives rise to the need for a search strategy designed to account for both the sample complexity and the detection accuracy, as well as cope with statistical models that are known only up to some missing parameters. In this work we propose a sequential search strategy using two variations of the Generalized Local Likelihood Ratio statistic. Our proposed Hierarchical Dynamic Search (HDS) strategy is shown to be order-optimal with respect to the size of the search space and asymptotically optimal with respect to the detection accuracy. An explicit upper bound on the error probability of HDS is established for the finite sample regime. Extensive experiments are conducted, demonstrating the performance gains of HDS over existing methods.
Original languageEnglish
StatePublished - 2022

Publication series



Dive into the research topics of 'Composite Anomaly Detection via Hierarchical Dynamic Search.'. Together they form a unique fingerprint.

Cite this