mlsanityData to 14 Oct 2026

Rethinking Feature Alignment in Generalist Graph Anomaly Detection: A Relational Fingerprint-based Approach

arXiv 2605.25429 ↗First posted 25 May 2026cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Generalist graph anomaly detection (GAD) aims to detect anomalies on unseen graphs without graph-specific retraining. Nevertheless, existing approaches primarily focus on aligning heterogeneous features across different data domains via PCA-based projection, which harmonizes feature dimensions ignores feature semantics. As a result, GAD models fail to learn transferable semantic knowledge, and even exhibit negative transfer on unseen graphs. To address this issue, we propose a Relational Fingerprint-based generalist GAD approach (ReFi-GAD for short), aligning heterogeneous raw features with a universal and semantics-aware Relational Fingerprint (ReFi) that encodes anomaly-indicative cues from both contextual and structural perspectives. Building on ReFi, we design a fingerprint-grounded generalist GAD model, which combines a transformer-based encoder to capture domain-invariant knowledge with an SNR-guided refinement module for domain-specific adaptation. Extensive experiments on 14 datasets demonstrate that ReFi-GAD significantly outperforms state-of-the-art methods.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 6 of its 55 references that are in the map. First posted on arXiv 25 May 2026.

Builds on

6 of 55 references.

References · 6

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  4. 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 343
  5. 2021Boost then Convolve: Gradient Boosting Meets Graph Neural Networkscited by 44
  6. 2024Zero-shot Generalist Graph Anomaly Detection with Unified Neighborhood Promptscited by 28

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 4.

4 papers.