Mitigating Anomaly Hallucination: A Model-Agnostic Framework for Unsupervised Anomaly Detection on Dynamic Graphs
Yingxuan Li, Yuanyuan Xu, Xuemin Lin, Ying Zhang
Abstract
Temporal graph neural networks (T-GNNs) are powerful for representation learning on continuous-time dynamic graphs (CTDGs), but naively applying them to unsupervised anomaly detection is often unreliable. The key challenge is learning normal dynamics while being exposed to unlabeled anomalies, which destabilizes optimization and anomaly scoring. We further observe that gradient spikes are not unique to anomalies: many normal nodes also have large gradient norms. These nodes are typically sparse, offering limited temporal-structural context for message passing, so T-GNNs may mistake event sparsity for abnormality under an unsupervised setting. We term this phenomenon anomaly hallucination, which increases false positives and degrades detection performance. To address this challenge, we propose AHEAD, an unsupervised anti-hallucination anomaly detection framework featuring a hallucination refinement pipeline and a temporal-structural detector, which is compatible with various T-GNN backbones for reliable anomaly detection on CTDGs. For the refinement pipeline, we define a node-level uncertainty score that combines gradient norms and temporal-structural residuals to quantify optimization sensitivity, and then filter out high-sensitivity nodes for training the T-GNN backbone, which stabilizes gradient flow and improves representation learning. To sharpen the decision boundary, we propose an amplified divergence loss that ensures a wider discrepancy between normal dynamics and latent anomalies, reducing the false positive rate. Last, we theoretically and empirically show loss separability as a natural indicator of abnormality and build on this insight to develop a temporal-structural anomaly detector, improving detection performance. Extensive experiments demonstrate that the proposed AHEAD consistently improves anomaly detection accuracy, achieving up to 28.02% AUROC gains across five T-GNN backbones.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- Fine-Grained Anomaly Detection on Dynamic Graphs via Attention AlignmentDong Chen, Xiang Zhao, Weidong XiaoICDE 2024 · 8 citations
- SmoothGNN: Smoothing-aware GNN for Unsupervised Node Anomaly DetectionXiangyu Dong, Xingyi Zhang, Yanni Sun, Lei Chen et al.WWW 2025 · 16 citations
- Revisiting Graph-Level Anomaly Detection: From Partially to Fully Unsupervised LearningZhenyu Yang, Ge Zhang, Shan Xue, Xiaoxiao Ma et al.WWW 2026
- BAG: Benchmarking Anomaly Detection on Dynamic GraphsFengrui Hua, Yiyan Qi, Zikai Wei, Yuxing Tian et al.AAAI 2026
- Learning Discriminative and Generalizable Anomaly Detector for Dynamic Graph with Limited SupervisionYuxing Tian, Yiyan Qi, Fengran Mo, Weixu Zhang et al.ICML 2026
