AnomalyGFM is a graph foundation model designed for zero- and few-shot anomaly detection in graphs. It learns graph‑agnostic normal and abnormal prototypes by aligning data‑independent class representations with node representation residuals, enabling consistent abnormality measurement across diverse graph datasets. Experiments on 11 real‑world GAD datasets show that AnomalyGFM outperforms state‑of‑the‑art methods in both zero‑shot and few‑shot settings.
By Hezhe Qiao, Chaoxi Niu, Ling Chen, Guansong Pang
arXiv:2605.26857v2 Announce Type: replace
Abstract: Driven by the pressing demand for graph anomaly detection (GAD) in high-stakes domains, the generalist GAD paradigm, which trains a single detector...
By Yiming Xu, Zihan Chen, Zhen Peng, Song Wang, Bin Shi, Bo Dong, Chao Shen
arXiv:2606. 12673v1 Announce Type: cross Abstract: Cross-domain graph anomaly detection (GAD) aims to identify abnormal nodes in unseen target graphs, showing strong potential in real-world applications with heterogeneous graph data.
By Phan Nguyen, Dat Cao, Hien Chu, Khue Hoang
The paper investigates whether synthetic data can replace real-world training data for generalist graph anomaly detection (GAD). It introduces AG-FORGE, a framework that automatically generates anomalous graphs, and shows that synthetic data can match real-world performance but does not surpass it due to method limitations. To overcome this, the authors propose TS-GGAD, a model that jointly learns topological and semantic anomaly cues with a curriculum learning strategy, achieving superior results on 14 real-world datasets when trained on AG-FORGE-generated data.
By Yujing Liu, Yixin Liu, Yue Tan, Xiaofeng Cao, Alan Wee-Chung Liew, Heng Tao Shen, Shirui Pan
arXiv:2602. 20019v2 Announce Type: replace-cross Abstract: Dynamic graph anomaly detection is critical for many real-world applications but remains challenging due to the scarcity of labeled anomalies.
By Yuxing Tian, Yiyan Qi, Fengran Mo, Weixu Zhang, Jian Guo, Jian-Yun Nie
GLASS is a graph‑level anomaly detection framework that aligns graph and language representations on a unit hypersphere to achieve cross‑domain transferability. It constructs a Graph Descriptor Prompt to encode local, global, and semantic graph properties, and uses a multi‑slice soft cosine objective to unify graph and text embeddings. Anomaly scoring is performed via spherical density estimation with von Mises‑Fisher kernels, enabling zero‑shot detection and few‑shot adaptation across twelve benchmarks and three meta‑domains, outperforming recent GLAD baselines.
By Xudong Wang, Chris Ding, Tongxin Li, Jicong Fan
The paper introduces Jev-GAD, a training‑free generalist graph anomaly detection framework that combines complementary structural, attribute, and neighborhood evidence with a single frozen pretrained language model for anomaly assessment. It transforms heterogeneous statistics into graph‑relative percentiles and uses a semantic Graph‑to‑State (G2S) transformation to feed evidence into a non‑generative decision readout, fusing the resulting scores with four statistical measures. Experiments on seven benchmark datasets show Jev‑GAD achieving high AUROC (89.18%) and AUPRC (52.40%) scores, demonstrating the effectiveness of pretrained decision readout and semantic evidence grounding.
By Xinyu Zhao, Qingyun Sun, Ziwei Zhang, Tianchen Zhu, Daqing Li, Jianxin Li
FoundAna is a GNN‑assisted foundation model designed for graph anomaly detection across diverse datasets. It combines a GNN component with a transformer encoder enhanced by four positional encodings to capture both local and global structure, using reconstruction errors as anomaly scores. Experiments on nine benchmark datasets from financial, social, and citation networks show that FoundAna consistently outperforms state‑of‑the‑art baselines.
By Suprim Nakarmi, Chahana Dahal, Yue Zhao, Junggab Son, Zuobin Xiong
arXiv:2511. 22078v2 Announce Type: replace Abstract: Many real-world scenarios involving streaming information can be represented as temporal graphs, where data flows through dynamic changes in edges over time.
By Simone Mungari, Albert Bifet, Giuseppe Manco, Bernhard Pfahringer
The paper introduces a statistical feature augmentation technique that encodes behavioral interaction statistics into the input space for dynamic graph anomaly detection. Experiments on Reddit, Wikipedia, and MOOC datasets across seven models—both continuous-time and discrete-time—show that this augmentation consistently improves detection performance compared to models trained on original embeddings. The enriched input also facilitates fine-grained post-hoc analysis of behavioral importance, linking classical network analysis with deep learning.
By Philipp Schlinge, Jean-Luc Schnipper, Martin Atzmueller
The paper introduces DPA, a diffusion-based framework that decouples product-agnostic anomaly representations to enable zero-shot anomaly generation. By reusing real anomalies from existing source products and filtering them for plausibility, DPA learns product-irrelevant anomaly embeddings that can be transferred across products. An adaptive mask-guided pipeline and a training-free labeling module further refine the realism and localization of generated anomalies, leading to improved performance on MVTec-AD, VisA, and a new anomaly-transfer benchmark.
By Hang Yao, Yansheng Fu, Ming Liu, Zifei Yan, Yanli Ji, Hongzhi Zhang, Wangmeng Zuo
arXiv:2609.35059v2 Announce Type: replace
Abstract: 3D anomaly detection (3DAD) aims to identify defective regions in point cloud data, serving as a critical component in industrial inspection system...
By KunHo Heo, SuYeon Kim, Hayoung Lee, Chanse Oh, MyeongAh Cho