acceptodds
Under review as a conference paper at ICLR 2027

Is Real-World Training Data Necessary for Generalist Graph Anomaly Detection?

Abstract

Generalist graph anomaly detection (GAD) aims to build a foundation model that detects anomalies on arbitrary unseen graphs without retraining or fine-tuning. Sufficient data are essential for foundation model training, yet generalist GAD still faces a data shortage, as real-world anomalous graphs are scarce and costly to collect and annotate. To fill this gap, we propose AG-FORGE, an Anomalous Graph Generation Forge for automatic synthesis of anomalous graphs, exploring the feasibility of synthetic data-driven training for generalist GAD. Empirically, we find that training on synthetic data achieves performance comparable to training on real-world data, but does not further improve the performance of existing methods due to their limited capacity. To better exploit increasingly large-scale training data, we develop TS-GGAD, a Topology-Semantic Coordinated Generalist Graph Anomaly Detection model that captures complementary topological and semantic anomaly evidence, together with a curriculum learning strategy tailored to large-scale synthetic training. Extensive experiments on 14 real-world datasets demonstrate that TS-GGAD, trained on data generated by AG-FORGE, consistently outperforms state-of-the-art methods.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
anomaly detection, synthetic data, generalist model

Reviews

Among:
Shape:
1234this paper, Top 15%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 3.00 over 3 reviews, above 85% of the others.
Reviewer_LihFOpenReview ↗
Rating
3
Confidence
4
Informativeness
3
Presentation
3
Soundness
2
Read review
Paper summary

The main novelty lies in exploring fully synthetic training for generalist graph anomaly detection and demonstrating its feasibility on real-world graphs. Specifically, AG-FORGE provides a configurable pipeline for generating diverse graph structures, node features, and anomaly patterns with controllable difficulty, while TS-GGAD combines topology-aware and semantic representations with curriculum learning to exploit large-scale synthetic data. The contribution is therefore not solely a new anomaly detector, but a unified framework for synthetic data generation and generalist GAD training. The experiments further investigate whether synthetic training can achieve competitive performance without relying on real-world training graphs.

Critical strengths
  1. The paper investigates whether synthetic data can address the data scarcity that limits the scalability of generalist graph anomaly detection.

  2. AG-FORGE generates diverse anomalous graphs, while TS-GGAD combines topological and semantic evidence with curriculum learning. Ablation studies provide evidence for the effectiveness of these components.

  3. Experiments on 14 real-world datasets demonstrate strong AUROC performance, while comparisons with real-world-trained generalist methods provide preliminary evidence for the feasibility of synthetic-data-driven training.

Critical weaknesses
  1. AG-FORGE relies on predefined graph structures and anomaly injection rules, but the paper does not systematically evaluate how synthetic data diversity and generation scale affect generalization or distinguish performance on naturally occurring versus injected anomalies.

  2. As shown in Table 1, synthetic training causes notable performance drops for some methods on certain datasets, such as ARC on Amazon and ReFi-GAD on Flickr. The paper does not analyze the underlying causes or clarify when synthetic training benefits or harms generalization.

Questions for authors

See Weaknesses.

2 comments
AuthorsOpenReview ↗

Author Response to Reviewer LihF (Revisions Included in the Updated Manuscript)

To Q1: We have evaluated the impact of synthetic data diversity through detailed ablations in Appendix Table 6. Removing any structure, feature, or anomaly generation strategy reduces average AUROC by 0.95–3.54 percentage points. Specifically, removing individual strategies from these three generation stages leads to average drops of 2.33, 1.80, and 1.07 percentage points, respectively, demonstrating the importance of diverse graph environments and anomaly patterns. To further systematically investigate the impact of synthetic data diversity, we conducted additional experiments. we investigate how the diversity of generation strategies affects cross-domain generalization by jointly changing the number of topology, feature, and anomaly generation strategies from 1 to 3. To ensure a fair comparison, we maintain the same number of synthetic graphs and report the average results over five random seeds.

TopologyFeatureAnomalyAverage AUROC (%)
11179.04 ± 1.87
22283.23 ± 0.88
33384.56 ± 0.89

The average AUROC consistently improves from 79.04% to 84.56% as the number of generation strategies increases, demonstrating that greater synthetic data diversity leads to better cross-domain generalization. We further investigate the contributions of graph diversity and anomaly pattern diversity. For anomaly diversity, the ablations in Appendix Table 6 show that removing each of the four basic anomaly generation strategies reduces average AUROC by 0.95–1.28 percentage points, with an average decrease of 1.07 percentage points. This indicates that diverse anomaly patterns provide complementary information for generalist GAD training. For graph diversity, we conduct additional experiments by varying the numbers of topology and feature generation strategies while keeping all five anomaly strategies available. The results are summarized below.

TopologyFeatureAnomalyAverage AUROC (%)
11583.62 ± 1.60
22584.55 ± 1.19
33584.82 ± 1.37

The results show that increasing graph diversity improves average AUROC from 83.62% to 84.82% (+1.20 percentage points) when the anomaly strategy pool is fixed, further supporting the importance of diverse structural and feature environments. Together, these experiments demonstrate that both graph diversity and anomaly pattern diversity contribute to effective cross-domain generalization. Regarding training scale, Fig. 5 systematically evaluates synthetic training data scales from 5K to 1M nodes under different model capacities. The results show that increasing training data generally improves cross-domain generalization when sufficient model capacity is available, while smaller models may struggle to fully exploit large-scale synthetic data. This highlights the importance of jointly scaling training data and model capacity, further supporting the motivation behind AG-FORGE and TS-GGAD.

Regarding anomaly origins, our 14 benchmarks include 8 datasets with injected anomalies (e.g., Cora, ACM, BlogCatalog) and 6 with naturally occurring anomalies (e.g., Weibo, Reddit, Amazon). TS-GGAD achieves the best AUROC on all datasets, with average results of 91.40% and 80.24% for the two groups, respectively. Importantly, TS-GGAD is pretrained entirely on synthetic graphs, yet achieves strong performance on datasets containing naturally occurring anomalies. This provides further evidence that AG-FORGE supports learning transferable anomaly knowledge rather than merely fitting predefined synthetic anomaly patterns.

To W2: We believe these performance variations are mainly related to the limited capacity of existing generalist GAD models, which were originally designed for relatively limited real-world training data**. When faced with large-scale and diverse synthetic data, their limited capacity may prevent them from fully exploiting the rich anomaly information**, leading to performance differences across target domains.

Nevertheless, synthetic training also brings substantial improvements, such as +10.98% for ARC on Facebook and +4.75% for ReFi-GAD on YelpChi. Overall, existing methods still achieve competitive generalization, with ReFi-GAD even improving its average rank from 4.50 to 3.86**. These results suggest that the benefits of synthetic training depend on model capacity**. While existing models may struggle to fully exploit diverse synthetic data, more expressive models can better leverage such data for generalization. This further motivates TS-GGAD, which achieves the best AUROC on all 14 datasets through effective topology-semantic anomaly modeling.

Thank you for the detailed response and additional experiments. The authors have adequately addressed all my concerns. I am satisfied with the clarifications and will maintain my original score.

Reviewer_whxrOpenReview ↗
Rating
4
Confidence
4
Informativeness
3
Presentation
3
Soundness
3
Read review
Paper summary

This paper points out that existing Generalist Graph Anomaly Detection (GGAD) models are constrained by limited training data, which hinders the increase of model complexity and the achievement of stronger generalization capabilities. To address this, the authors designed an Anomalous Graph generation Forge (AG-Forge) for automatic synthesis of anomalous graphs, thus providing sufficient training data for the GGAD model. Building on this, the authors develop a Topology-Semantic coordinated Generalist GAD (TS-GGAD) model, which integrates anomalous signals from both topological and semantic aspects to generate anomaly scores. Extensive experimental results demonstrate that the proposed algorithm achieves stronger generalization ability than existing GGAD models trained on real data when trained using only generated data.

Critical strengths
  1. This article focuses on the problem of limited training data in GGAD tasks and proposes an anomalous graphs generation framework. This study is the first to demonstrate that using only generated data is sufficient to train an effective GGAD model, providing new insights for subsequent research.
  2. The authors have designed a novel GGAD model that achieves more comprehensive anomaly detection by jointly modeling anomalous signals from both the topological and semantic aspects.
  3. Experimental results indicate that the proposed model, when trained exclusively on generated data, achieves state-of-the-art anomaly detection performance across 14 real-world benchmark datasets.
  4. The paper is well-structured and clearly written, allowing readers to readily grasp the authors' research motivation and design rationale.
Critical weaknesses
  1. The text in some experimental results figures is too small, such as in Fig.3, which reduces the reader's reading experience.
  2. The method employs a random partitioning strategy when dividing nodes into groups after the graph structure generation, this may weaken the correlation between the node groupings and the underlying graph topology.
  3. In the course learning section, the authors sampled the dataset based on the difficulty factor δ\delta. However, δ\delta affects different anomaly generation schemes in different ways, so the value of δ\delta may not fully correspond to the actual detection difficulty of the graph, which may affect the actual learning process of the model.
Questions for authors
  1. At the end of the structure generation section, it is mentioned that some graph groups are obtained by random partitioning. This seems to weaken the association between node grouping and graph topology. Why is it designed this way instead of uniformly adopting the Louvain community detection strategy?
  2. The difficulty of anomaly detection is not only related to the anomaly pattern, but usually also to the structure and feature distribution of the graph. Did the author consider the discrepancy between δ\delta and the actual detection difficulty? Will this inconsistency still affect the effectiveness of the phased increasing difficulty strategy in curriculum learning?
2 comments
AuthorsOpenReview ↗

Author Response to Reviewer whxr (Revisions Included in the Updated Manuscript)

To W1: We thank the reviewer for this valuable suggestion. We will improve the readability of the figures, particularly Fig. 3, by increasing the font sizes and refining the visual details in the final version.

To W2 & Q1: We appreciate the reviewer's insightful question. While Louvain produces groups closely aligned with graph topology, uniformly adopting it may lead to synthetic graphs with overly strong structural-feature homophily. However, real-world graphs often exhibit varying levels of homophily, including low-homophily environments where nodes with similar features are not necessarily closely connected. Therefore, we intentionally combine Louvain with random partitioning to simulate diverse levels of structural-feature homophily. This allows AG-FORGE to generate more diverse graph environments, preventing the model from overfitting to idealized community structures and helping it learn more generalizable anomaly knowledge. To validate this design, we conducted an additional ablation by removing random partitioning and using Louvain alone. The average AUROC drops from 86.61% to 85.27% (−1.34 percentage points), demonstrating the importance of diverse structural-feature relationships for cross-domain generalization.

To W3 & Q2: We agree that the predefined difficulty factor (δ\delta) may not fully reflect the actual detection difficulty, as graph structures, feature distributions, and anomaly patterns can also affect it. This issue has been considered in Section 3.3. Specifically, (δ\delta) provides a coarse easy-to-hard ordering by controlling anomaly distinguishability, rather than precisely measuring the difficulty of each graph. To address this discrepancy, we further introduce Dynamic Loss-Aware Soft Sampling. Since models tend to learn easier patterns first, relatively harder graphs may retain higher losses during early training**. Our strategy tracks these losses using EMA and assigns higher sampling probabilities to graphs that remain difficult**, allowing the model to learn them more effectively in subsequent training. This also helps compensate for inaccurate difficulty ordering based on (δ\delta). Furthermore, Node-Level Focal Optimization emphasizes difficult nodes within each graph. Therefore, our curriculum learning does not solely depend on the predefined difficulty factor, and the ablation results further support its effectiveness.

I appreciate the authors for the detailed responses. My previous concerns have been adequately addressed. Therefore, I would like to keep my positive score for the paper and recommend acceptance.

Reviewer_ssXzOpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper investigates whether real-world training data are necessary for generalist graph anomaly detection. The authors propose AG-FORGE, a synthetic anomalous graph generation framework that combines diverse graph structures, node feature distributions, and anomaly injection mechanisms. To better utilize the generated data, the authors further introduce TS-GGAD, which integrates topological and semantic anomaly representations through an adaptive gating mechanism, together with a curriculum learning strategy. Experiments show that TS-GGAD, trained entirely on synthetic graphs, achieves strong cross-domain generalization and outperforms existing methods in terms of AUROC.

Critical strengths

S1. The paper investigates the feasibility of replacing scarce real-world training data with synthetic data for generalist GAD, addressing a practical limitation of existing methods.

S2. AG-FORGE combines multiple structural, feature, and anomaly generation mechanisms, providing controllable training data with diverse anomaly patterns and difficulty levels.

S3. The proposed method achieves the highest AUROC on all 14 evaluated datasets. The experiments also include comparisons with existing generalist GAD methods, component ablations, and scaling analysis.

Critical weaknesses

W1. Although the results demonstrate the potential of synthetic training, the comparison between synthetic and real-world training is not fully controlled. The training sets differ substantially in size, making it difficult to distinguish the benefit of synthetic data from that of additional training samples. More controlled comparisons using identical architectures, matched data sizes, and training budgets are needed.

W2. TS-GGAD requires labeled normal and anomalous support nodes during inference. This assumption limits its applicability when anomaly labels are unavailable in unseen graphs. The paper should better distinguish synthetic-only source training from fully label-free deployment and clarify the fairness of comparisons with zero-shot baselines.

W3. AG-FORGE relies on relatively simple graph generators and predefined anomaly injection rules. Their ability to represent complex real-world anomalies remains unclear. Moreover, comparable AUROC does not always translate into comparable AUPRC, with substantial degradation for some baselines trained on synthetic data.

W4. Although AnomalyGFM is discussed in the related work, it is not included in the experiments. Furthermore, several components of TS-GGAD build on established techniques, including handcrafted topological statistics, feature alignment, adaptive fusion, and curriculum learning. More comparisons and finer-grained ablations would help establish the specific methodological contributions.

W5. Potential inconsistencies in the ablation results. In Table 7, the results of the variant without curriculum learning closely match those of ReFi-GAD in Table 1, including several identical dataset-level AUROC values. These results should be verified and explained.

Questions for authors

See the above

2 comments
AuthorsOpenReview ↗

Author Response to Reviewer ssXz (Revisions Included in the Updated Manuscript)

To W1: We thank the reviewer for this valuable suggestion. To address this concern, we conducted additional experiments training our proposed TS-GGAD model using approximately 93K synthetic nodes, comparable to the average real-world training scale (~92K nodes). All other experimental settings, including model architecture and training budgets, were kept identical. The results show that synthetic training achieves a higher average AUROC than real-world training (84.20% vs. 82.87%, +1.33 percentage points) across 14 datasets. This demonstrates that AG-FORGE generates diverse and effective training graphs with comparable or better generalization at a similar scale. More importantly, a central motivation of AG-FORGE is to overcome real-world data scarcity by generating abundant and diverse training samples to support the scaling of generalist GAD models. While the controlled comparison demonstrates the effectiveness of synthetic data at a comparable scale, the ability to generate substantially larger training corpora is equally important. AG-FORGE thus alleviates the real-world data bottleneck and enables further improvements in model capacity and generalization.

To W2: We agree that zero-shot GAD is an important direction. However, few-shot is also a common setting in generalist GAD. Unlike images or text, graphs lack a unified feature vocabulary and vary greatly in structure and anomaly patterns. Thus, a few labeled target nodes can help improve detection. In our experiments, ARC, IA-GGAD, and ReFi-GAD use few-shot inference, while UNPrompt uses zero-shot. For IA-GGAD, we used the few-shot implementation provided in its codebase. We will clarify these settings in the final version. TS-GGAD is trained entirely on synthetic data and only requires a few labeled support nodes at inference. To explore zero-shot inference, we further tested TS-GGAD using 60 randomly selected unlabeled nodes as presumed normal references, without accessing any target labels. Even without specific zero-shot adaptations, TS-GGAD achieves 67.69% average AUROC, outperforming UNPrompt (66.17%). This shows the potential of our method for label-free inference. We will further explore zero-shot GAD with more diverse synthetic training data.

To W3: We agree that reproducing complex real-world anomalies is challenging. However, AG-FORGE aims to cover diverse graph environments and anomaly patterns rather than fit a specific real-world distribution, helping models learn more generalizable anomaly knowledge. The effectiveness and reliability of AG-FORGE-generated data are supported by our experiments: TS-GGAD achieves 86.61% AUROC with large-scale synthetic data versus 82.87% with real data. At similar scales (~93K vs. ~92K nodes), synthetic data still perform slightly better (84.20% vs. 82.87%). Fig. 7 also shows broader, more continuous synthetic coverage overlapping with real data. Regarding AUPRC, we attribute these performance drops to the limited expressiveness of existing generalist models, which may not fully exploit diverse synthetic data, causing small ranking errors to which AUPRC is sensitive. Still, the average drop is limited (e.g., 1% for ReFi-GAD), and UNPrompt slightly improves. TS-GGAD achieves the best AUPRC on 10 of 14 datasets, supporting the value of stronger models for synthetic training.

To W4: We attempted to reproduce AnomalyGFM but obtained only 50.76% average AUROC. Although this differs from its original results, it is consistent with those reported in recent work such as ReFi-GAD. We therefore excluded it to avoid an unreliable comparison. Our main contribution is AG-FORGE, which provides diverse synthetic data to support more expressive generalist GAD models. TS-GGAD is designed to fully exploit large-scale synthetic data. Its key innovation lies in coordinating complementary topological and semantic anomaly evidence to learn more generalizable anomaly knowledge across graph domains. Figs. 3–4 and Appendix F.2–F.3 provide detailed ablations confirming the effectiveness of generation strategies and model components.

To W5: We sincerely thank the reviewer for carefully checking our results and pointing out this inconsistency. We confirm that this was an oversight during table editing, and the correct results are provided below.

VariantCiteCSACMBlogAmzPhotoWeiboCoraPubmedFlickrFBYelpQuestRedditAvg
- Curr95.4599.3495.5873.3185.7575.5991.5595.4597.3180.3795.5173.7863.8763.5984.75
Ours96.5299.4396.2476.1987.1082.1593.5396.4197.7786.4697.4174.4664.6264.3186.61

We apologize for this error and thank the reviewer again for identifying it. We will correct Table 7 and the corresponding ablation results in the final version.

Thank you again for your review. We would like to kindly follow up on our rebuttal. We have conducted additional experiments and provided further clarifications to address your concerns. We would greatly appreciate it if you could take another look at our responses and the revised manuscript when time permits.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.