RADE: Resource-Efficient Supervised Anomaly Detection Using Decision Tree-Based Ensemble Methods
Shay Vargaftik, Isaac Keslassy, Ariel Orda, Yaniv Ben-Itzhak

TL;DR
This paper introduces RADE, a resource-efficient anomaly detection framework that combines coarse and fine-grained decision tree models to reduce memory, training time, and latency while maintaining detection accuracy.
Contribution
The paper proposes a novel hybrid DTEM approach that uses confidence thresholds to selectively route queries to expert models, improving efficiency without sacrificing accuracy.
Findings
RADE reduces memory footprint by up to 5.46x.
RADE decreases training time by up to 17.2x.
RADE cuts classification latency by up to 31.2x.
Abstract
Decision-tree-based ensemble classification methods (DTEMs) are a prevalent tool for supervised anomaly detection. However, due to the continued growth of datasets, DTEMs result in increasing drawbacks such as growing memory footprints, longer training times, and slower classification latencies at lower throughput. In this paper, we present, design, and evaluate RADE - a DTEM-based anomaly detection framework that augments standard DTEM classifiers and alleviates these drawbacks by relying on two observations: (1) we find that a small (coarse-grained) DTEM model is sufficient to classify the majority of the classification queries correctly, such that a classification is valid only if its corresponding confidence level is greater than or equal to a predetermined classification confidence threshold; (2) we find that in these fewer harder cases where our coarse-grained DTEM model results…
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.
