用表格大模型做图异常检测,无需重新训练即可跨数据集通用。
Tabular Foundation Models are Strong Graph Anomaly Detectors
- 将图结构转为增强特征表,让表格大模型理解图拓扑。
- 在多个数据集上超越专用模型,零样本迁移效果显著。
- 适合缺乏标注数据、需快速适配新场景的异常检测任务。
图异常检测(GAD)旨在识别偏离多数的异常节点,在高风险网络领域日益重要。然而现有方法遵循‘一个数据集一个模型’范式,导致计算成本高、数据需求大,且跨数据集泛化能力差。本文提出TFM4GAD,一种利用表格基础模型(TFM)进行图异常检测的框架。核心思路是:现代TFM通过合成预训练和上下文学习,天然擅长处理异构特征、跨域泛化与少量标注,其主要障碍在于对图结构无感知。TFM4GAD通过“展平”图结构,构建包含拉普拉斯嵌入、局部/全局结构特征及异常敏感邻域聚合的增强特征表,使TFM在全上下文模式下处理。在多个数据集上使用不同TFM骨干网络的实验表明,该方法在不重新训练的情况下,显著优于从头训练的专用GAD模型,验证了其作为通用图异常检测器的潜力。
原文摘要 · Abstract (English)
Graph anomaly detection (GAD), which aims to identify abnormal nodes that deviate from the majority, has become increasingly important in high-stakes Web domains. However, existing GAD methods follow a "one model per dataset" paradigm, leading to high computational costs, substantial data demands, and poor generalization when transferred to new datasets. This calls for a foundation model that enables a "one-for-all" GAD solution capable of detecting anomalies across diverse graphs without retraining. Yet, achieving this is challenging due to the large structural and feature heterogeneity across domains. In this paper, we propose TFM4GAD, a simple yet effective framework that adapts tabular foundation models (TFMs) for graph anomaly detection. Our key insight is that the core challenges of foundation GAD, handling heterogeneous features, generalizing across domains, and operating with scarce labels, are the exact problems that modern TFMs are designed to solve via synthetic pre-training and powerful in-context learning. The primary challenge thus becomes structural: TFMs are agnostic to graph topology. TFM4GAD bridges this gap by "flattening" the graph, constructing an augmented feature table that enriches raw node features with Laplacian embeddings, local and global structural characteristics, and anomaly-sensitive neighborhood aggregations. This augmented table is processed by a TFM in a fully in-context regime. Extensive experiments on multiple datasets with various TFM backbones reveal that TFM4GAD surprisingly achieves significant performance gains over specialized GAD models trained from scratch. Our work offers a new perspective and a practical paradigm for leveraging TFMs as powerful, generalist graph anomaly detectors.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。