Zero-shot Generalizable Graph Anomaly Detection with Mixture of Riemannian Experts
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
The Flow has not summarised this story yet — read it at arXiv AI.
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.
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...
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.
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.
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.
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.