Anomaly detection and classification for streaming data using PDEs
Bilal Abbasi, Jeff Calder, Adam M. Oberman

TL;DR
This paper introduces a real-time streaming anomaly detection method using PDE-based ranking derived from Pareto Depth Analysis, offering fast computation and new classification capabilities for multi-criteria anomalies.
Contribution
It develops a PDE continuum limit-based streaming PDA algorithm for anomaly detection and classification, with proven convergence and improved computational efficiency.
Findings
Achieves fast real-time anomaly detection in streaming data.
Provides PDE-based classification of anomalies based on criterion violations.
Demonstrates effectiveness on synthetic and real datasets.
Abstract
Nondominated sorting, also called Pareto Depth Analysis (PDA), is widely used in multi-objective optimization and has recently found important applications in multi-criteria anomaly detection. Recently, a partial differential equation (PDE) continuum limit was discovered for nondominated sorting leading to a very fast approximate sorting algorithm called PDE-based ranking. We propose in this paper a fast real-time streaming version of the PDA algorithm for anomaly detection that exploits the computational advantages of PDE continuum limits. Furthermore, we derive new PDE continuum limits for sorting points within their nondominated layers and show how the new PDEs can be used to classify anomalies based on which criterion was more significantly violated. We also prove statistical convergence rates for PDE-based ranking, and present the results of numerical experiments with both…
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.
