acceptodds
Under review as a conference paper at ICLR 2027

Graph Foundation Model for Cross-granularity Anomaly Detection

Abstract

Graph Foundation Models (GFMs) for Graph Anomaly Detection (GAD) have gained massive attention, playing important roles in academic and industrial circles. Existing models are mainly divided into two types: granularity-specific cross-domain models (GSCD) and cross-granularity domain-specific models (CGDS), which focus on improving cross-domain ability or cross-granularity ability. However, they fail to explore GAD under cross-granularity cross-domain settings. The aim of this study is to provide a unified solution for GFMs in cross-granularity GAD scenarios. To solve this problem, we propose a novel framework, CgGFAD, specializing in two challenges in this problem. On the one hand, to capture granularity-specific semantics and enhance cross-granularity detection ability, CgGFAD unifies the representations for different granularities and employs maximum mean discrepancy based on the Wasserstein distance to evaluate the similarity between granularities. On the other hand, to capture comprehensive granularity-specific representations and achieve cross-domain generalization, CgGFAD develops a cluster-based self-distillation and prototype generalization module, which leverages deep clustering strategies to derive latent semantic patterns and deploys prototype approximation to achieve cross-domain detection. Extensive experiments on diverse public datasets, compared with state-of-the-art baselines, demonstrate the advancement and effectiveness of CgGFAD.

Primary area:
unsupervised, self-supervised, semi-supervised, and supervised representation learning
Keywords:
Graph anomaly detection, graph foundation model, zero-shot learning

Reviews

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

This paper studies unsupervised cross-domain, cross-granularity graph anomaly detection and proposes CgGFAD, which combines node-level representation alignment, Wasserstein-based granularity discrimination, cluster-based self-distillation, and prototype generalization to detect anomalies without retraining on target domains. Experiments on 14 datasets across multiple transfer directions report performance improvements over existing baselines.

Critical strengths
  1. This work provides clear motivation, application background, and a framework.
  2. The cross-granularity generalization proposed in this work is sound.
  3. Experiments cover multiple datasets, and the results seem good.
Critical weaknesses
  1. The method uses source-domain representations at both the training and test granularities, but does not clarify how they are adapted to cross-granularity tasks.
  2. The practical necessity of optimizing the anomaly detection objective at only one granularity is insufficiently justified.
  3. The full-model results in Table 8 duplicate those in Table 6, although the tables indicate different training and test dataset assignments.
  4. The connection between granularity separation and knowledge transfer is insufficiently justified.
Questions for authors
  1. Do all baselines have access to the same source-domain granularity information as CgGFAD, and how are they adapted to cross-granularity tasks?
  2. When representations at both granularities are available in the source domain, why is the anomaly detection objective optimized at only one granularity, and what substantive innovation does this setting offer beyond GFM-UAD?
  3. Why do the full-model results in Table 8 match those in Table 6 despite different training/test dataset assignments, while differing from Table 2 under the same setting?
  4. Please further explain how granularity separation facilitates cross-granularity transfer of anomaly-related knowledge, and justify the use of means and standard deviations to characterize representations and construct the MMD loss.
  5. Node features may differ in dimensionality and semantics across datasets; how does CgGFAD handle these differences and achieve cross-dataset feature alignment?
Reviewer_Hzj2OpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper investigates unsupervised graph anomaly detection in cross-domain and cross-granularity scenarios, where a model trained on a specific dataset and at a specific granularity is directly applied to detect anomalies at a different granularity on an unseen dataset with no need for retraining. To this end, the authors propose the CgGFAD framework, which learns both shared and granularity-specific information through granularity-specific graph encoders, node-level representation alignment, and a granularity-discriminating objective based on Wasserstein distance. Furthermore, the framework combines clustering-based self-distillation and prototype learning to model normal patterns, and utilizes distillation bias and prototype distance to compute anomaly scores. The authors evaluated four transfer tasks—node-to-edge, edge-to-node, node-to-graph, and graph-to-node—across 14 datasets, reporting performance improvements over selected baselines. They also analyzed the roles of individual components and the model’s performance through ablation experiments, parameter sensitivity analysis, and efficiency experiments.

Critical strengths

(1)The research question is practically significant, and the research motivation is clear. The paper focuses on the problem of graph anomaly detection when anomalies occur across domains and across granularities simultaneously, extending the research scope of existing methods, which typically address only a single granularity or a specific data domain. This problem provides a valuable perspective for evaluating the transferability of graph anomaly detection models.

(2)Extensive experiments validate the method’s effectiveness. The paper examines bidirectional transfer between nodes and edges, as well as between nodes and graphs, across 14 datasets, reporting AUROC, AUPRC, and results from five runs with different random seeds. In addition to key performance comparisons, the paper includes module ablation studies, parameter sensitivity analyses, distance function comparisons, and efficiency analyses, providing comprehensive experimental evidence to understand the method’s performance and the contributions of its individual components. Translated into English

Critical weaknesses
  1. Insufficient justification. Although the paper provides performance comparisons and ablation experiments, these results are insufficient to support the explanations behind several key design choices. Firstly, Equation (4) directly transforms the Wasserstein distance into a form similar to MMD, but lacks a derivation of its relationship with standard MMD or proof of optimisation stability; furthermore, compressing high-dimensional representations into mean and standard deviation requires further justification as to whether this preserves the semantic information required for anomaly detection. Secondly, whilst the granularity differentiation objective actively separates the representation distributions across different granularities, inference relies on prototypes learnt at the training granularity; the paper has not yet adequately explained why this separation facilitates cross-granularity transfer. Finally, when the training data contains a high proportion of outliers, clustering prototypes may absorb anomalous patterns; the assumption that self-distillation and adaptive weighting can reliably learn normal patterns still requires support from contamination rate experiments and prototype analysis. Consequently, the existing experiments primarily illustrate the association between components and performance improvements, whilst validation of their mechanisms of action and conditions of applicability remains insufficient.

  2. The writing contains several careless errors and inconsistencies:

    • Appendix D ends with the incomplete sentence “for graph-level anomaly detection,” leaving the graph-level implementation details unspecified.
    • The caption of Table 6 incorrectly defines G$ \rightarrow $N as training on the edge-level task and testing on the graph-level task. It should refer to graph-level training and node-level testing.
    • There are repeated words, e.g., “testingtesting” in the caption of Table 5 and “Eq. Eq.” in Step 6 of Algorithm 1.
    • Section 5.1 labels the second baseline group as “GSCD,” although the preceding categorization indicates “CGDS.” It also states “two types of baselines” but lists three categories. -Tables 2 and Table 8 both report the results of the full CgGFAD model in the final row of each task block. However, under the training and testing settings indicated by their headers, the reported results differ substantially. For example, for the N$ \rightarrow $G task with BM-MN as the training dataset and BM-MS as the test dataset, the AUPRC is 31.2 in Table 2 but 53.8 in Table 8—a difference of 22.6 percentage points. Please clarify the reasons.

If you can address my concern, I'm willing to raise my score.

Questions for authors

(1) The granularity discrimination objective in Equation (4) explicitly encourages separation between the representation distributions of the training and test granularities. Meanwhile, in Section 4.3, prototypes are constructed based on the representations of the training granularity and are subsequently used for anomaly scoring in Equation (13). Despite this encouraged distribution separation, what assumptions underlie the ability of these source-granularity prototypes to transfer to the test granularity? Can a theoretical basis or empirical analysis be provided regarding the distances between normal and anomalous samples at different granularities and their respective source prototypes, to demonstrate that this separation preserves transferable normality information rather than inducing negative transfer?

(2) Table 4 shows that the dimensionality of node features varies across datasets; however, Equation (1), which defines the graph encoder, does not specify how these incompatible input spaces are mapped to a common representation space. Given the “inference without retraining” setting described in Section 4.4, can the authors elaborate on the complete input adaptation procedure, including any feature projection, padding, normalization, or semantic alignment? Specifically, which steps rely solely on the source data for fitting, and which steps (if any) require statistical information from the target domain or additional parameter learning?

Reviewer_KaE1OpenReview ↗
Rating
2
Confidence
4
Informativeness
2
Presentation
1
Soundness
1
Read review
Paper summary

This paper introduces CgGFAD, which is an unsupervised model for cross-granularity (node, edge, and graph-level), cross-domain (different graphs) graph anomaly detection (GAD). Both unsupervised cross-granularity and cross-domain GAD have been studied independently by previous work, this paper combines the two. CgGFAD combines multiple node-level encoders for each granularity, node-level alignment across granularities, an MMD discrepancy loss for discrimination across granularities, prototypes, and a cluster-based distillation deviation. The intuition is that anomalies in the target dataset are instances whose representations deviate from the clusters learned from the source dataset and/or whose cluster assignments cannot be consistently reproduced by the student encoder. The experiments compare CgGFAD against granularity-specific cross-domain models, cross-granularity domain-specific models, and traditional GAD methods. Fourteen datasets (both single and multi-graph) are applied in the evaluation, in terms of AUROC and AUPRC. The experiments focus on settings are both cross-granularity and cross-domain (e.g., node-level on Reddit to edge-level on T-Finance) in the zero-shot setting. The results show that CgGFAD consistently outperforms all the baselines in both single graph and multi-graph experiments and an ablation study shows the contribution of each major component of CgGFAD.

Critical strengths

S1) The paper addresses a novel problem setting: cross-domain, cross-granularity anomaly detection.

S2) The experiments show that CgGFAD achieves promising results compared with the baselines.

S3) Some ideas in the paper seem novel in the context of GAD, such as cluster-based self-distillation step.

Critical weaknesses

W1) The problem motivation is unclear: what is the need for unsupervised cross-granularity anomaly detection methods? Is it a way to improve results within a granularity (i.e., positive transfer across tasks)? Or does it lead to computational savings in training or inference? One could simply train granularity-specific methods and use the accordingly. It is unclear if this simpler approach was considered as a baseline.

W2) Important design decisions require further justification: what is the motivation for using independent node-level encoders that are both aligned and forced to be distinct (MMD loss)? The edge and graph-level aggregation are simple functions of the node-level ones and it is unclear why these two losses need to be combined and how they complement each other. Using a single node-level encoder without the alignment or the MMD loss seems to be a more intuitive approach and it is similar to what other GFMs do.

W3) Novelty and justification for the cluster-based distillation should be strengthened. This seems to be a major contribution of the paper, but, as mentioned in the paper, similar ideas are applied by deep clustering approaches. This should be made more clear. Moreover, the results show that the prototype and distillation scores perform poorly independently, but achieve very good results when used together. The paper should explain better why that is the case and better isolate the benefit of the combined loss from the remaining of the model.

W4) Some important experiments are missing: I was not able to find any comparison against single granularity or single domain methods in their original setting. Are the advantages of the proposed approach present only under the combine setting? This would be a weakness of the paper (see W1 also).

W5) Figures and tables are very hard to read with the current font sizes.

Questions for authors

Q1) What is the need for unsupervised cross-granularity anomaly detection methods?

Q2) What is the justification multiple encoders and the combination of the alignment and discriminative terms in the loss?

Q3) How does the cluster-based distillation method compares against existing work on deep clustering?

Q4) Why are the results for the combined scores (distillation an prototypes) so superior to the individual scores?

Q5) How does the proposed method compare against: (1) single granularity cross-domain methods, (2) single domain multi-granularity methods, and (3) traditional unsupervised GAD methods when applied to their original problem settings?

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

Related papers

Loading the map…

Discussion (0)

Sign in to comment.