acceptodds
Under review as a conference paper at ICLR 2027

RECAP: Residual Community Adhesion Patterns for Generalist Graph Anomaly Detection

Abstract

Generalist graph anomaly detection aims to identify anomalous nodes in unseen graphs without target-specific retraining. Existing approaches often rely on source-graph labels, target prompts, or coarse normal/anomalous prototypes, which may be unreliable when labels are unavailable and both normal and anomalous patterns are diverse. This paper proposes **RECAP**, a framework based on **RE**sidual **C**ommunity **A**dhesion **P**atterns for label-free cross-graph detection. Rather than transferring a binary anomaly boundary, the method learns a residual-pattern mapping by aligning soft community assignments with similarity graphs constructed from high-order ego-neighbor residual representations. During inference, predicted assignments induce community prototypes, and anomalies are ranked by prototype adhesion deviation with an auxiliary neighborhood community-context inconsistency term. This formulation captures diverse residual patterns while preserving a decomposed score that attributes anomalies to prototype deviation, local community-context mismatch, or both. Cross-dataset transfer experiments show that, without source labels, target prompts, or target fine-tuning, RECAP achieves competitive anomaly-ranking performance under multiple source–target splits. Beyond ranking accuracy, the framework provides model-intrinsic diagnostics through community prototypes, decomposed adhesion/context scores, and node-level reports, offering structured behavioral evidence beyond a scalar anomaly score.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
graph anomaly detection, community assignments

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_DiccOpenReview ↗
Rating
2
Confidence
4
Informativeness
2
Presentation
2
Soundness
1
Read review
Paper summary

This paper presents RECAP, a label-free framework for generalist graph anomaly detection. The method performs graph-wise feature preprocessing and constructs multi-hop ego-neighbor residual representations. It then builds a residual-similarity graph and learns soft residual-community assignments. At test time, target-specific community prototypes are derived from the predicted assignments, and anomaly scores are computed using prototype deviation together with a neighborhood-context inconsistency term. Experiments show improvements on the given datasets compared to the given baselines.

Critical strengths
  1. The paper targets a meaningful and difficult setting.
  2. Experiments show improvements on given datasets compared to given baselines.
Critical weaknesses
  1. The evaluation seems to tune hyperparameters on the unseen target graphs. The main page describes Setting A as training on PubMed, Flickr, Questions, and YelpChi and testing on eight unseen target graphs. However, Appendix D.4 states that these experiments train on PubMed/Flickr/Questions/YelpChi and evaluate on Facebook, Cora, CiteSeer, ACM, BlogCatalog, Weibo, Reddit, and Amazon. It looks like test model selection uses target labels.
  2. The experiments do not prove that "transferable residual-community learning" is useful. Removing the proposed community-consistency loss and the assignment regularization changes performance little. The two losses for learning the proposed residual-community structure contribute almost nothing to final gains.
  3. RECAP fits PCA independently on every graph, including every target graph, before feeding the result into a shared MLP. This makes dimensionality equal, but it does not prove cross-graph coordinate alignment.
Questions for authors
  1. Can the authors rerun the experiments where test graphs are never used for hyperparameter selection?
  2. What evidence demonstrates that source-trained community learning itself is necessary for the gains?
Reviewer_BQ5cOpenReview ↗
Rating
2(−1)
Confidence
3
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

The paper proposes RECAP, a label-free generalist graph anomaly detector. It learns residual-pattern communities from source graphs without anomaly labels and transfers the learned assignment function to unseen graphs. Anomaly scores combine deviations from community prototypes with neighborhood-context inconsistencies. The evaluation covers both cross-graph transfer and target-specific unsupervised detection.

Critical strengths
  1. The label-free transfer setting is meaningful. RECAP requires neither source anomaly labels nor target prompts, making the deployment assumptions less restrictive than those of several existing generalist detectors.

  2. The experimental protocol distinguishes supervised cross-graph baselines from unsupervised target-specific methods. The factorial ablation also provides useful evidence that residual features and community-based scoring work better together than separately.

Critical weaknesses
  1. The contribution of the learned community-consistency objective is less convincing than that of the residual representation and adhesion score. In Table 13, removing the community-consistency loss changes AUROC from 74.48 to 74.20 and barely affects AUPRC. This raises the question of whether the learned community structure is essential to the reported performance.

  2. The proposed diagnostic capability is not evaluated as thoroughly as anomaly ranking. Community assignments and decomposed scores are useful outputs, but their correspondence to actual anomaly mechanisms remains largely unverified.

Questions for authors
  1. Why does removing the community-consistency loss have so little effect if transferable community learning is a central contribution?

  2. What evidence shows that the reported community-level diagnostics reflect meaningful anomaly patterns rather than clustering artifacts?

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

RECAP addresses label-free cross-graph anomaly detection by learning soft communities of ego-neighbor residual patterns. A frozen model assigns target nodes to communities, constructs target-specific prototypes, and scores anomalies through prototype deviation and neighborhood-context inconsistency.

Critical strengths

Addresses a useful setting without source anomaly labels, target prompts, or target fine-tuning.

Clearly distinguishes target-specific detection from cross-graph transfer and discloses differences in baseline supervision.

Includes multiple source–target splits, component ablations, stability analyses, and scalability experiments.

Transparently reports limitations, including unsuccessful predictive transfer to large graphs.

Critical weaknesses

Section 4.2 and Appendix D.4 motivate default settings using performance on the evaluation targets. It is unclear whether these targets’ labels influenced configuration selection, which would weaken the claimed unseen-target evaluation.

Table 13 shows little change when removing community consistency or entropy regularization individually. A randomly initialized, frozen model with identical prototype scoring—and a variant removing both losses—would help establish what transferable community learning contributes.

Independently fitted PCA standardizes dimensions but does not ensure corresponding coordinates across graphs. The shared MLP is not inherently invariant to PCA sign changes or rotations. Robustness to these ambiguities should be evaluated.

RECAP trails stronger supervised methods in Settings A/B, while all three large-graph evaluations yield below-chance AUROC (Table 12). These failures substantially limit its practical generalist claim, although the paper acknowledges them.

Questions for authors
  • Specify a source-only or separate validation protocol for all hyperparameters, then report results on untouched targets.

  • Add untrained-model and joint-loss-removal controls with identical preprocessing and scoring.

  • Test sensitivity to PCA sign flips, coordinate rotations, and alternative feature alignment methods.

  • Provide per-target results and investigate whether large-graph failures arise from residual representations, prototype contamination, or reversed score ordering.

  • Clarify that label-derived “high-risk community” descriptions in Figure 4 are retrospective analyses rather than information available during label-free deployment.

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

Related papers

Loading the map…

Discussion (0)

Sign in to comment.