acceptodds
Under review as a conference paper at ICLR 2027

Role-GAD: Role-Aware Graph Anomaly Detection via Dual-Codebook Vector Quantization

Abstract

Graph anomaly detection (GAD) is fundamental to identifying fraudulent and abnormal behaviors in financial and social networks. Unlike node classification, where classes often form relatively coherent distributions, we empirically show that graph anomalies arise from heterogeneous mechanisms and remain highly fragmented, whereas normal data exhibit fewer recurring semantic and structural patterns. These findings motivate a prototype-based representation principle: recurring normal patterns should be summarized through a compact set of semantic and relational roles, while heterogeneous anomaly mechanisms remain distinguishable through rare role assignments and atypical role interactions. Based on this principle, we propose \model, a role-aware framework that abstracts node semantics and edge interactions into dual discrete role codebooks and performs role-aware message passing over a role-induced graph augmented with global role-triplet statistics. Extensive experiments on five real-world benchmarks demonstrate that Role-GAD achieves the best average performance while converging up to faster than the strongest accuracy-oriented baseline. Our code and data are available at https://anonymous.4open.science/r/role-gad-5932.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
Graph anomaly detection, representation learning, vector quantization

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_4WzmOpenReview ↗
Rating
2(+1)
Confidence
3
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper studies the supervised graph anomaly detection problem and proposes a role-aware GAD method. The motivation of this method is that anomalies are heterogeneous and fragmented while normal nodes follow a few recurring patterns. Role-GAD encodes nodes and edges with MLPs and quantizes them into a semantic-role codebook and an interaction-role codebook, respectively. Then each edge is represented as a <node role, edge, role, node role> triplet. The log-frequency of each triplet over the graph is added as a prior to the graph attention over the quantized representations, and the model is trained with weighted cross-entropy plus reconstruction and commitment losses. Experiments conducted on several graph benchmarks demonstrate the effectiveness and efficiency of the proposed method.

Critical strengths
  • The proposed Role-GAD is based on a clear and well-motivated idea. Factorizing nodes and edges into discrete roles and using global triplet frequencies as a structural prior is an intuitive and fairly novel use of VQ for GAD.
  • The proposed method is effective and more efficient compared to baselines. The training is less costly, with complexity linear in |E| for a fixed codebook size.
  • Experiments are comprehensive. The paper reports the GAD performance, efficiency, and interpretability analyses of the learned roles. The appendix also covers weighted vs. unweighted loss, codebook utilization and collapse, the Hadamard term, EMA decay, loss weights, codebook size, etc.
Critical weaknesses
  • The motivation is not completely new. Anomalies with low or heterogeneous homophily have been well studied in previous studies, e.g., BWGNN, GHRN, and others in the GAD heterophily literature. Additionally, two of the five datasets contradict one of the two observations.
  • Although the proposed Role-GAD is well-motivated, it is based on empirical observations, and there is no theoretical analysis.
  • The ablation studies (shown in Table 3) show that Interaction Role dominates in both roles. Interaction Role Only already reaches 90.37 AUPRC on YelpChi, versus 90.66 for Dual Roles. More explanations should be provided.
  • Edge roles are a deterministic function of features. The roles are computed only from x_u and x_v, with no structural input, so an interaction role is essentially a cluster of feature pairs. This makes it unclear whether the role adds more information beyond a strong edge-feature attention.
  • The baselines are a mix of results from CGADM and rerun with an added cross-entropy loss, which makes the comparison less fair.
  • Unsupervised autoencoders outperform dedicated supervised GAD methods by a wide margin on YelpChi (GUIDE 91.48 and DOMINANT 86.69 vs. BWGNN 49.15 and GHRN 49.78). XGBGraph reaches 75.91 here, but 91.11 AUPRC under GADBench in Table 4.
  • Some results are inconsistent. For example, Table 1 gives YelpChi AUROC 98.64, while Table 2 and D.1 give 97.88.
  • Weighting is slightly worse on most datasets, then why is weighting the selected strategy in the experiments?
Questions for authors
  • Why does the Interaction role achieve similar performance to the dual roles?
  • Why does YelpChi Semantic Role Only have very low performance?
  • Explain the design of the edge role (see above).
  • Make a fairer comparison with all rerun results.
  • Why are some results inconsistent?
4 comments

We thank the reviewer for the constructive feedback. We acknowledge that some experimental settings and details were not sufficiently clarified, which may have caused confusion. We provide detailed clarifications below.

A1. Novelty and empirical motivation (W1)

We agree that heterophily in graph anomaly detection has been extensively investigated. However, our work addresses a different aspect of anomaly heterogeneity. Specifically, BWGNN analyzes the spectral energy shift caused by anomalies and designs wavelet filters to capture high-frequency signals, while GHRN identifies and prunes heterophilic edges to reduce their negative influence on message passing. In contrast, our analysis examines both feature diversity and neighborhood composition, motivating the explicit modeling of recurring semantic and interaction patterns rather than treating heterogeneous connections primarily as signals to filter or remove.

We acknowledge that Elliptic and YelpChi are exceptions to the corresponding observations. Importantly, Role-GAD does not assume that anomalies must exhibit low homophily or dispersed features. Instead, we propose dual semantic and interaction role codebooks, allowing different interaction patterns to be distinguished and further combined into global role triplets for role-aware message passing. Therefore, our novelty lies not in rediscovering heterophily, but in jointly modeling recurring semantic and interaction patterns through discrete roles and their global compositions.

A2. Theoretical motivation and analysis (W2)

We acknowledge that Role-GAD is empirically motivated and does not currently provide formal theoretical guarantees. However, the proposed design is supported by both its modeling mechanism and empirical analysis. Discrete semantic and interaction roles enable the construction of reusable role triplets, whose global frequencies are incorporated into role-aware message passing (Eqs. 10–12). Section 4.3 provides further empirical evidence: Figure 3 shows that frequently occurring semantic roles are predominantly associated with normal nodes, while Figure 4 demonstrates that role triplets capture not only common Normal–Normal interactions, but also distinct patterns associated with Anomaly–Anomaly and Anomaly–Normal interactions. Together with the improvements from global role-triplet modeling in Table 3, these findings support the effectiveness of role-based modeling, although they do not constitute a formal theoretical guarantee.

A3. Detailed ablation analysis

To clarify the ablation settings in Table 3, Role-GAD uses 256 semantic and 64 interaction prototypes on YelpChi. Interaction Role Only retains the original node features while learning 64 interaction roles, without semantic quantization. In contrast, Semantic Role Only quantizes node features into 256 semantic roles but removes interaction-role learning. Since YelpChi contains only one untyped edge relation, this variant cannot explicitly distinguish different interaction patterns.

  • W3 + Q1: Why is Interaction Role Only close to Dual Roles?

On YelpChi, Interaction Role Only achieves 90.37 AUPRC, close to 90.66 for Dual Roles. This may be attributed to YelpChi's highly homophilic anomaly patterns, where modeling pairwise interactions already provides strong discriminative signals, while the original node features preserve semantic information without quantization. While semantic quantization alone brings a modest improvement, global role-triplet modeling further increases AUPRC from 90.66 to 94.90, highlighting the value of combining semantic and interaction roles for global role-aware message passing. These results suggest that the contribution of semantic roles extends beyond local quantization to supporting global role-triplet modeling.

  • Q2: Why is Semantic Role Only so low on YelpChi?

On YelpChi, Semantic Role Only compresses node features into 256 semantic prototypes, while the graph contains only a single untyped edge relation. Without learned interaction roles, the model cannot explicitly distinguish heterogeneous pairwise interaction patterns, resulting in a low AUPRC of 18.57. This highlights the limitation of relying solely on semantic roles to capture the diverse interaction patterns in YelpChi.

A4. Interaction Role Design and Its Contribution Beyond Edge-Feature Attention (W4 + Q3)

Interaction roles are learned from node features, but their purpose is not to introduce additional information. Instead, vector quantization maps similar interactions to shared discrete roles, allowing recurring interaction patterns to be explicitly identified. These learned interaction-role representations are directly incorporated into role-aware attention, enabling the model to distinguish different interaction patterns during message passing. Furthermore, interaction roles are combined with semantic roles to construct role triplets, whose global frequency statistics capture structural regularities and further guide message passing (Eqs. 10–12). Therefore, interaction roles not only provide explicit interaction representations for local message passing but also enable global role-triplet modeling, connecting local interaction patterns with global structural regularities.

A5. Baseline fairness and supervised/unsupervised comparisons (W5 + W6 + Q4)

Our main experiments (Table 1) follow the evaluation protocol of CGADM (NeurIPS 2025), a recent SOTA GAD method, using 20%/10%/70% train/validation/test splits and reporting average results over 10 random splits. Specifically, the supervised GNN and GAD baseline results are directly adopted from CGADM rather than rerun by us. To provide a more comprehensive comparison, we additionally include autoencoder-based GAD methods, which are predominantly unsupervised in their original formulations. This comparison is particularly relevant because Role-GAD also incorporates encoder–decoder architectures and reconstruction objectives to support role learning. These baselines are evaluated using the same data split protocol, with an additional cross-entropy loss to incorporate training labels and enable comparison under a supervised setting. The strong performance of GUIDE and DOMINANT on YelpChi is therefore not inherently contradictory, as different model architectures can exhibit different performance characteristics even under the same supervision setting.

Regarding XGBGraph, the difference between 75.91 AUPRC in Table 1 and 91.11 in GADBench reflects different evaluation settings. Specifically, Table 3 of the GADBench paper reports a 70% training ratio for YelpChi, whereas CGADM uses 20%. Thus, these results should not be directly compared under the assumption of identical experimental settings.

To further assess whether Role-GAD's effectiveness depends on the CGADM evaluation protocol, we additionally evaluate it against GADBench-reported baselines in Appendix D.2, covering seven datasets. Role-GAD achieves higher reported AUPRC across all seven comparisons, providing further evidence of its effectiveness across different evaluation settings. We will clarify the sources of baseline results, training configurations, and protocol differences in the revised manuscript.

A6. YelpChi AUROC inconsistency (W7 + Q5)

The two values correspond to different reporting purposes. Table 1 reports the average AUROC of 98.64 over 10 independent runs, with the corresponding standard deviation provided in Table 5 of Appendix D.3, demonstrating the stability of our results. In contrast, Table 2 and Appendix D.1 report the AUROC of 97.88 from one of these runs, which was selected for the convergence efficiency analysis. Therefore, the difference arises from reporting the average performance versus a single-run result, rather than inconsistent experimental settings. We will clarify this distinction in the corresponding table captions to avoid confusion.

A7. Why use weighted cross-entropy? (W8)

DatasetWeightedUnweightedΔ\Deltap-value
YelpChi94.90 ± 0.7692.33 ± 0.93+2.570.00017
Elliptic91.96 ± 0.1892.05 ± 0.60−0.090.67849
Tolokers50.08 ± 2.9250.11 ± 1.74−0.040.97959
Questions18.74 ± 0.3117.83 ± 0.60+0.910.00118
Reddit11.45 ± 0.4810.36 ± 1.06+1.080.02017

We adopt weighted cross-entropy to address class imbalance in graph anomaly detection, where anomalous nodes are typically much less frequent than normal nodes. To further examine its impact, we compare weighted and unweighted cross-entropy across five datasets. The results show that weighting improves AUPRC on YelpChi (+2.57), Questions (+0.91), and Reddit (+1.08), while having minimal impact on Elliptic (−0.09) and Tolokers (−0.04). These findings suggest that the benefits of loss weighting are dataset-dependent. We therefore adopt weighted cross-entropy as a consistent training strategy rather than selecting the loss function separately for each dataset.

The authors' rebuttal addresses most of my concerns, except for novelty and theoretical analysis. I have therefore increased my rating.

We sincerely thank the reviewer for carefully reconsidering our rebuttal and for increasing the rating. We appreciate the recognition of our efforts to address the concerns.

Regarding the remaining concerns, we would like to reiterate that our key contribution lies in jointly modeling semantic and interaction patterns through discrete roles and their global compositions, rather than simply revisiting heterophily in GAD. We will further clarify this distinction and the empirical evidence supporting our design in the revised manuscript. We thank the reviewer again for the constructive feedback.

Reviewer_m4mGOpenReview ↗
Rating
4(+2)
Confidence
4
Informativeness
2
Presentation
1
Soundness
2
Read review
Paper summary

This paper proposes Role-GAD, a graph anomaly detection framework based on dual-codebook vector quantization. Motivated by the observation that anomalous nodes often exhibit more heterogeneous feature and neighborhood patterns than normal nodes, the method introduces two discrete codebooks to capture semantic roles and edge interaction roles. These representations are further incorporated into role-aware message passing with global role-triplet statistics to model recurring structural patterns. Experiments on five real-world datasets demonstrate competitive performance against existing GAD methods, supported by ablation studies, role interpretability analyses, and convergence comparisons.

Critical strengths
  1. Interesting modeling perspective. The paper explores graph anomaly detection through semantic and interaction roles, offering an alternative to conventional continuous representation learning. The separation of node-level semantics and edge-level interactions provides a potentially useful perspective for modeling heterogeneous anomaly patterns.

  2. Encouraging empirical results. Role-GAD achieves competitive performance across five real-world datasets against a relatively broad set of baselines. The ablation studies and convergence comparisons provide additional evidence of the framework's practical effectiveness.

Critical weaknesses
  1. The empirical motivation may be confounded by class imbalance. The paper motivates its design through two observations: anomalous nodes have larger same-label kNN distances and exhibit more heterogeneous neighborhood compositions. However, both measurements are potentially affected by the substantial class imbalance inherent in graph anomaly detection. Since anomalous nodes are typically much fewer than normal nodes, their same-label nearest-neighbor distances can be larger even without meaningful differences in feature organization. Similarly, their lower same-label homophily may partly arise from the lower prevalence of anomalies rather than distinctive structural behaviors. Without class-balanced comparisons or appropriate null-model analyses, it remains unclear whether these observations genuinely establish the heterogeneous anomaly mechanisms that motivate Role-GAD.

  2. Insufficient justification for the transition from heterogeneous anomalies to discrete role modeling. Although the paper argues that normal patterns are relatively recurring while anomalous behaviors are heterogeneous, it does not convincingly explain why vector quantization is particularly suitable for addressing this distinction. Mapping representations into discrete codebooks may compress recurring normal patterns, but it can also obscure subtle or rare anomaly-specific information. Furthermore, the proposed global role-triplet statistics emphasize frequently occurring configurations, without sufficient justification of how this mechanism handles uncommon but legitimate interactions or frequently recurring anomalous patterns. The connection between the empirical observations, dual-codebook abstraction, and improved anomaly discrimination remains insufficiently established.

  3. Insufficient evidence isolating the benefits of vector quantization. While Role-GAD achieves encouraging results, the ablation experiments mainly evaluate the contributions of semantic roles, interaction roles, and global role-triplet modeling. They do not establish whether discrete vector quantization itself is necessary or superior to continuous representations within the same architecture. In Table 3, interaction-role modeling alone already achieves most of the performance of the dual-role variant on some datasets, particularly YelpChi and Tolokers. Moreover, the full model combines multiple components, including edge encoding, role-aware attention, and global structural priors. Without a matched continuous-representation baseline and more controlled comparisons, it is difficult to attribute the reported improvements specifically to the proposed role abstraction mechanism.

Questions for authors
  1. How do the authors distinguish the observed feature and structural heterogeneity of anomalous nodes from the effects of class imbalance? Would the conclusions in Figures 1 and 2 remain consistent under class-balanced sampling or appropriate null-model comparisons?

  2. What specifically makes discrete vector quantization more suitable than continuous representations for modeling heterogeneous anomalies? How does the proposed framework preserve rare but informative anomaly patterns during quantization?

  3. Can the authors provide a controlled comparison between the proposed dual-codebook framework and a corresponding continuous-representation variant with the same encoders, message-passing architecture, and comparable model capacity? This would help clarify whether the performance improvements primarily arise from vector quantization or other architectural components.

3 comments

We thank the reviewer for the constructive feedback. We address the concerns with the following clarifications and additional experiments.

A1. Class Imbalance and Empirical Observations (W1 + Q1)

To control for class imbalance, we randomly sample equal numbers of normal and anomalous nodes (80% of the minority-class size) over 50 repetitions, using L2-normalized features and Euclidean distances. We report two metrics: (1) Rf(10)R_f(10), the ratio of median distances to the 10th nearest same-label neighbor for anomalies versus normals; and (2) dAN/dAAd_{AN}/d_{AA}, the ratio of an anomalous node's nearest normal-node distance to its nearest anomalous-node distance.

DatasetOriginal Rf(10)R_f(10)Balanced Rf(10)R_f(10), median [Q25, Q75]Balanced dAN/dAAd_{AN}/d_{AA}, median [Q25, Q75]
YelpChi1.2391.042 [1.038, 1.044]1.087 [1.084, 1.090]
Tolokers1.6500.665 [0.649, 0.692]1.400 [1.336, 1.450]
Questions1.4080.996 [0.987, 1.004]1.096 [1.082, 1.113]
Reddit2.1750.967 [0.954, 0.981]1.100 [1.068, 1.120]
Elliptic0.2680.203 [0.201, 0.206]6.823 [6.704, 6.984]

Class imbalance substantially affects the original distance ratios, and anomalies are not universally more dispersed after balancing. Nevertheless, dAN/dAA>1d_{AN}/d_{AA}>1 across all five datasets reveals varying degrees of local anomaly affinity, supporting the exploration of reusable semantic representations.

For Figure 2, we acknowledge that the observed homophily distributions may also be influenced by class prevalence. Therefore, these distributions should be interpreted as descriptive properties of the naturally imbalanced graphs, rather than evidence of intrinsic structural heterogeneity independent of class imbalance.

Importantly, Role-GAD does not require anomalies to be intrinsically more dispersed or less homophilic. Instead, it aims to represent reusable semantic and interaction patterns through shared discrete roles and their global role-triplet compositions. The analysis in Section 4.3 and ablation results in Table 3 provide empirical support for this modeling design.

A2. Why discrete role modeling? (W2 + Q2)

The motivation for vector quantization is not that discrete representations inherently contain more information than continuous ones, but that they provide explicit, reusable identities for recurring semantic and interaction patterns. Through the dual codebooks, similar representations are mapped to shared prototypes, allowing the model to identify recurring patterns while retaining distinct role assignments for different interactions.

More importantly, these discrete identities enable global semantic–interaction–semantic role-triplet modeling (Eqs. 10–12), incorporating global interaction regularities into local message passing.

Regarding rare anomaly patterns, the codebooks are learned through reconstruction and commitment objectives (Eqs. 5–9), which encourage the quantized representations to preserve information from their original embeddings. Furthermore, the global triplet statistics are incorporated as attention priors rather than hard filtering rules. Thus, rare interactions are not explicitly removed, and frequently occurring interactions are not automatically classified as normal.

Section 4.3 provides further empirical support: Figure 3 shows that frequently used semantic roles are predominantly associated with normal nodes, while Figure 4 reveals distinct occurrence patterns among Normal–Normal, Anomaly–Anomaly, and Anomaly–Normal role triplets. These findings support the role-based modeling motivation, although they do not establish that quantization preserves every rare anomaly pattern.

A3. Contribution of vector quantization and comparison with continuous representations (W3 + Q3)

We additionally evaluate a continuous-representation variant that retains the same node/edge encoders and local message-passing architecture while replacing quantized roles with continuous embeddings.

DatasetSettingAUPRCAUROC
YelpChiContinuous91.8097.75
Role-GAD94.9098.64
TolokersContinuous48.6980.09
Role-GAD50.0880.74
EllipticContinuous90.5996.86
Role-GAD91.9697.59

The results show that Role-GAD consistently outperforms the continuous variant. Importantly, the value of VQ extends beyond local representation learning. Discrete semantic and interaction roles enable the construction of reusable role triplets, whose global frequency statistics further guide message passing. These findings highlight that VQ not only provides discrete semantic and interaction representations for local message passing, but also enables global role-triplet frequency modeling, incorporating global structural regularities into message passing.

Reviewer_m4mGOpenReview ↗

Official Comment by Reviewer m4mG

The authors' rebuttal has addressed my concerns regarding class imbalance and vector quantization. I have therefore increased my rating from 2 to 4.

We sincerely thank the reviewer for their positive feedback and for recognizing our efforts to address the concerns regarding class imbalance and vector quantization. We greatly appreciate the reviewer’s reconsideration and willingness to increase the rating.

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

This paper proposes Role-GAD to address anomaly dispersion and heterogeneous interaction patterns in graph anomaly detection. The framework employs dual-codebook vector quantization to map node semantics and edge interactions into discrete semantic and interaction roles. It then incorporates global role-triplet statistics into role-aware message passing for supervised anomaly detection. Experiments on five real-world datasets show that Role-GAD achieves the best average detection performance among the compared methods, with additional timing experiments demonstrating faster convergence than CGADM.

Critical strengths
  1. Analyses of feature-space distances and node-level homophily provide empirical support for the motivation to model heterogeneous anomaly patterns.
  2. The framework uses dual codebooks to capture node semantics and edge interactions and incorporates global role-triplet statistics into role-aware message passing, yielding a clear and interpretable design.
  3. Comparisons across five datasets, complemented by component ablations on three datasets, support the effectiveness of dual-role modeling and global role-triplet statistics.
Critical weaknesses
  1. Section 2.1 compares the dispersion of normal and anomalous nodes by calculating the distance from a node to its kk-th nearest neighbor within its class. However, even if both classes follow the same underlying distribution, the class with the smaller sample size may exhibit a larger distance to the nearest neighbor. While Appendix C explores different values ​​for kk, it does not explicitly account for differences in sample size between the classes. Could the authors perform multiple subsampling iterations of the normal nodes (ensuring that the number of subsampled nodes matches the number of anomalous nodes) and calculate the distance ratio and its corresponding uncertainty based on these subsamples?
  2. Equations (10)–(12) use global counts of role triplets to adjust message weights; however, these counts may be influenced by the size of each role and the degree of the node. Could the authors compare the raw counts against statistics that account for the frequency of role-based edges or the degree distribution? Furthermore, the paper interprets this mechanism as a process that "reinforces common patterns and weakens rare patterns"; yet, rare interactions themselves may contain valuable anomalous signals. Could the authors conduct an evaluation segmented by the frequency of role triplets to examine whether this mechanism diminishes the ability to detect rare, anomalous patterns?
Questions for authors

Please refer to my weaknesses.

4 comments

We sincerely thank the reviewer for the careful reading and for recognizing the empirical motivation, dual-codebook design, and complementary ablations. We address the two concerns below.

A1. Class-Balanced Feature Proximity Analysis

We thank the reviewer for highlighting the potential influence of class size on same-label nearest-neighbor distances. To address this concern, we conduct additional class-balanced feature-space analyses.

Experimental setup. For each dataset, we randomly sample equal numbers of normal and anomalous nodes, each corresponding to 80% of the anomalous class size, and repeat the procedure 50 times. Following Section 2.1, we apply L2 normalization to node features and use Euclidean distances. We examine two complementary metrics:

  • Same-label distance ratio Rf(10)R_f(10): The ratio of the median distances to the 10th nearest same-label neighbor for anomalous and normal nodes, respectively.
  • Nearest-neighbor distance ratio dAN/dAAd_{AN}/d_{AA}: For each anomalous node, dANd_{AN} is its distance to the nearest normal node, and dAAd_{AA} is its distance to the nearest other anomalous node. A ratio above 1 indicates greater proximity to another anomalous node.
DatasetOriginal Rf(10)R_f(10)Balanced Rf(10)R_f(10), Median [Q25, Q75]Balanced dAN/dAAd_AN/d_AA, Median [Q25, Q75]
YelpChi1.2391.042 [1.038, 1.044]1.087 [1.084, 1.090]
Tolokers1.6500.665 [0.649, 0.692]1.400 [1.336, 1.450]
Questions1.4080.996 [0.987, 1.004]1.096 [1.082, 1.113]
Reddit2.1750.967 [0.954, 0.981]1.100 [1.068, 1.120]
Elliptic0.2680.203 [0.201, 0.206]6.823 [6.704, 6.984]

First, class imbalance affects the original feature-distance observations. After balancing, Rf(10)R_f(10) decreases from 1.650 to 0.665 on Tolokers and from 2.175 to 0.967 on Reddit, indicating that anomalous nodes are not universally more dispersed than normal nodes. We acknowledge this limitation and will refine Observation 1 accordingly.

Second, the additional nearest-neighbor analysis reveals local anomaly affinity. The balanced dAN/dAAd_{AN}/d_{AA} exceeds 1 across all five datasets, suggesting that anomalous nodes tend to have closer anomalous neighbors, although the strength of this tendency varies across datasets. This indicates that anomalous features are not necessarily isolated or uniformly dispersed, but can exhibit recurring local similarities.

These findings provide a more nuanced understanding of anomalous feature distributions. Rather than assuming universally greater anomaly dispersion, our semantic-role modeling aims to represent reusable feature patterns through shared prototypes. We will clarify this motivation and the influence of class imbalance in the revised manuscript.

A2. Global Role-Triplet Frequency and Normalization

To investigate the influence of role frequency, we conduct an additional experiment replacing the raw triplet counts with role-normalized frequencies. Specifically, we normalize each triplet count by the total number of interactions associated with its source semantic role, while retaining the remaining Role-GAD architecture.

DatasetSettingAUPRCAUROC
YelpChiRaw Count (Role-GAD)94.9098.64
Role-Normalized91.4897.84
TolokersRaw Count (Role-GAD)50.0880.74
Role-Normalized51.4181.43
EllipticRaw Count (Role-GAD)91.9697.59
Role-Normalized90.8096.99

The results reveal a dataset-dependent trade-off. Role normalization improves AUPRC by 1.33 points and AUROC by 0.69 points on Tolokers, whereas raw counts perform better on YelpChi and Elliptic. This suggests that absolute interaction frequency and role-conditioned interaction frequency capture complementary aspects of global interaction patterns.

We further analyze the relationship between the two frequency statistics:

DatasetSpearman (Raw vs. Normalized)Top-10 Triplet Overlap
YelpChi0.7471/10
Tolokers0.3370/10
Elliptic0.3491/10

Regarding rare anomalous interactions, the original Role-GAD and its role-normalized variant share the same attention mechanism. In both cases, the global prior provides a soft, frequency-dependent modulation rather than explicitly filtering out low-frequency triplets. The learned semantic and interaction representations remain available to local attention, allowing rare interactions to contribute based on their contextual features.

Importantly, global triplet frequency is used to characterize interaction recurrence, not to determine whether an interaction is anomalous or informative. Thus, low-frequency patterns are not directly assigned low anomaly significance, and their contributions are jointly determined by local representations and global structural statistics.

Dear Reviewer,

We sincerely thank you for your constructive feedback and valuable questions.

As the rebuttal period is approaching its end, we would like to kindly follow up on our responses. We have provided additional analyses and experiments to address your concerns regarding class imbalance and vector quantization.

We hope these clarifications have adequately addressed your questions. If so, we would greatly appreciate your reconsideration of the overall assessment.

Thank you again for your time and thoughtful consideration.

Thank you for your clear explanation and additional experiments, which address my concerns. I have decided to maintain my score.

Thank you for your positive feedback and for acknowledging that our clarifications and additional experiments have addressed your concerns. We appreciate your time and thoughtful consideration throughout the discussion.

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

Related papers

Loading the map…

Discussion (0)

Sign in to comment.