TL;DR
This paper introduces scalable, nonparametric algorithms for real-time anomaly detection in high-dimensional data, utilizing univariate summaries, submanifold learning, and geometric entropy minimization to identify persistent outliers effectively.
Contribution
It presents novel scalable algorithms that detect anomalies in high-dimensional data without assuming known distributions, using univariate summaries and geometric methods.
Findings
Algorithms effectively detect anomalies quickly in high-dimensional data.
Proposed methods outperform existing techniques in accuracy and speed.
Theoretical bounds ensure low false alarm rates.
Abstract
Timely detection of abrupt anomalies is crucial for real-time monitoring and security of modern systems producing high-dimensional data. With this goal, we propose effective and scalable algorithms. Proposed algorithms are nonparametric as both the nominal and anomalous multivariate data distributions are assumed unknown. We extract useful univariate summary statistics and perform anomaly detection in a single-dimensional space. We model anomalies as persistent outliers and propose to detect them via a cumulative sum-like algorithm. In case the observed data have a low intrinsic dimensionality, we learn a submanifold in which the nominal data are embedded and evaluate whether the sequentially acquired data persistently deviate from the nominal submanifold. Further, in the general case, we learn an acceptance region for nominal data via Geometric Entropy Minimization and evaluate whether…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
