cs.LGOct 12, 2026

Feature-Context Consistency: Unsupervised Adversarial Detection with Drift Stability on Attributed Graphs

Authors: Firas Bayram, Maxime Cordy

Organizations: SnT, University of Luxembourg Luxembourg

Abstract

Adversarial detection on evolving attributed graphs faces two challenges: fraud labels arrive late or not at all, and natural distributional drift erodes any trained decision boundary. Modern detectors can reach strong detection rates when labels are available and the distribution is stationary; sustaining that quality without labels and under drift is the open problem. We identify feature-context consistency -- the alignment between a node's attributes and its aggregated neighborhood attributes -- as a single structural signal that addresses both. We formalize it as the Context Boost (CB) score within a Restricted Boltzmann Machine framework (CB-RBM) and prove two complementary worst-case guarantees: a strict separation between the expected CB of legitimate and adversarial nodes, with gap growing linearly in model capacity, whenever the adversary's context stays far enough from legitimate neighborhood context; and a Wasserstein-Lipschitz bound on how far the CB distribution moves under natural drift. We validate on XBlock Ethereum phishing (~153K nodes) and Reddit banned-user detection (~11K nodes), with two further datasets in the appendix spanning diverse domains. With zero labels, CB-RBM achieves AUROC >= 0.96 on four adversarial attacks and keeps FPR close to its calibrated 5% target under drift -- outperforming supervised GNNs (hundreds of labels), unsupervised graph-anomaly baselines, and a standard RBM whose FPR collapses to 89-100%. What typically requires separate mechanisms -- label-free operation and drift stability -- here follows from a single structural regularity of the data. Code: https://github.com/serval-uni-lu/CB-RBM.

Figures & tables

Appendix figures & tables27 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Graph Anomaly Detection as Finite-Horizon Control: Training-Free Scoring via Empirical Bayes

    Sep 29, 2026Fred Xu, Thomas Markovich, Florence Regol +1Anomaly Detection

  2. NK-GAD: Neighbor Knowledge-Enhanced Unsupervised Graph Anomaly Detection

    Apr 17, 2026Zehao Wang, Lanjun WangGraph Neural NetworksReconstruction-Based Anomaly Detection

  3. Generalist Graph Anomaly Detection via Prototype-Based Distillation

    May 26, 2026Yiming Xu, Zihan Chen, Zhen Peng +4Unsupervised Anomaly DetectionZero-Shot Anomaly Detection