把图数据转成表格,用通用模型实现零样本节点分类。
Bringing Graphs to the Table: Zero-shot Node Classification via Tabular Foundation Models
- 将每个节点构造成含特征、结构的表格行,用表格模型直接处理。
- 在28个真实数据集上超越专用GNN和顶尖图模型,平均提升显著。
- 适合想用通用模型做图学习、追求零样本泛化的研究者。
图基础模型(GFMs)虽具广泛泛化潜力,但常在非真实场景数据上训练,限制其表现。相比之下,表格基础模型(TFMs)不仅擅长经典表格预测任务,还在时间序列、自然语言处理与计算机视觉等领域展现强适用性。受此启发,本文另辟蹊径,将节点分类重构为表格问题:每个节点作为一行,包含特征、结构与标签信息作为列,使TFMs可通过上下文学习实现零样本分类。本文提出TAG方法,先通过特征与结构编码器将图转化为表格,再对多组随机子采样的表格应用多个TFMs,最后通过集成选择聚合输出。在28个真实世界数据集上的实验表明,TAG持续优于特定任务的GNN与当前最优的图基础模型,凸显了表格重构在可扩展、高泛化图学习中的潜力。
原文摘要 · Abstract (English)
Graph foundation models (GFMs) have recently emerged as a promising paradigm for achieving broad generalization across various graph data. However, existing GFMs are often trained on datasets that may not fully reflect real-world graphs, limiting their generalization performance. In contrast, tabular foundation models (TFMs) not only excel at classical tabular prediction tasks but have also shown strong applicability in other domains such as time series forecasting, natural language processing, and computer vision. Motivated by this, we take an alternative view to the standard perspective of GFMs and reformulate node classification as a tabular problem. In this reformulation, each node is represented as a row with feature, structure, and label information as columns, enabling TFMs to directly perform zero-shot node classification via in-context learning. In this work, we introduce TAG, a tabular approach for graph learning that first converts a graph into a table via feature and structural encoders, applies multiple TFMs to diversely subsampled tables, and then aggregates their outputs through ensemble selection. Experiments on 28 real-world datasets demonstrate that TAG consistently improves upon task-specific GNNs and state-of-the-art GFMs, highlighting the potential of the tabular reformulation for scalable and generalizable graph learning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。