LGAIFeb 23

Learning Discriminative and Generalizable Anomaly Detector for Dynamic Graph with Limited Supervision

arXiv:2602.20019v1h-index: 16
Originality Incremental advance
AI Analysis

This addresses a critical challenge in dynamic graph anomaly detection for real-world applications, offering a model-agnostic solution with improved generalization, though it is incremental as it builds on existing semi-supervised methods.

The paper tackles the problem of dynamic graph anomaly detection with limited labeled anomalies by proposing a framework that learns a discriminative boundary from normal/unlabeled data while leveraging available labeled anomalies without sacrificing generalization to unseen anomalies, achieving superior performance in extensive experiments.

Dynamic graph anomaly detection (DGAD) is critical for many real-world applications but remains challenging due to the scarcity of labeled anomalies. Existing methods are either unsupervised or semi-supervised: unsupervised methods avoid the need for labeled anomalies but often produce ambiguous boundary, whereas semi-supervised methods can overfit to the limited labeled anomalies and generalize poorly to unseen anomalies. To address this gap, we consider a largely underexplored problem in DGAD: learning a discriminative boundary from normal/unlabeled data, while leveraging limited labeled anomalies \textbf{when available} without sacrificing generalization to unseen anomalies. To this end, we propose an effective, generalizable, and model-agnostic framework with three main components: (i) residual representation encoding that capture deviations between current interactions and their historical context, providing anomaly-relevant signals; (ii) a restriction loss that constrain the normal representations within an interval bounded by two co-centered hyperspheres, ensuring consistent scales while keeping anomalies separable; (iii) a bi-boundary optimization strategy that learns a discriminative and robust boundary using the normal log-likelihood distribution modeled by a normalizing flow. Extensive experiments demonstrate the superiority of our framework across diverse evaluation settings.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes