paper-with-me

홈 › Papers

GRAVER: Generative Graph Vocabularies for Robust Graph Foundation Models Fine-tuning

2025-11-05 · Haonan Yuan, Qingyun Sun, Junhua Shi, Xingcheng Fu, Bryan Hooi, Jianxin Li, Philip S. Yu arxiv

Inspired by the remarkable success of foundation models in language and vision, Graph Foundation Models (GFMs) hold significant promise for broad applicability across diverse graph tasks and domains. However, existing GFMs struggle with unstable few-shot fine-tuning, where both performance and adaptation efficiency exhibit significant fluctuations caused by the randomness in the support sample selection and structural discrepancies between the pre-trained and target graphs. How to fine-tune GFMs robustly and efficiently to enable trustworthy knowledge transfer across domains and tasks is the major challenge. In this paper, we propose GRAVER, a novel Generative gRAph VocabulariEs for Robust GFM fine-tuning framework that tackles the aforementioned instability via generative augmentations. Specifically, to identify transferable units, we analyze and extract key class-specific subgraph patterns by ego-graph disentanglement and validate their transferability both theoretically and empirically. To enable effective pre-training across diverse domains, we leverage a universal task template based on ego-graph similarity and construct graph vocabularies via graphon-based generative experts. To facilitate robust and efficient prompt fine-tuning, we grave the support samples with in-context vocabularies, where the lightweight MoE-CoE network attentively routes knowledge from source domains. Extensive experiments demonstrate the superiority of GRAVER over effectiveness, robustness, and efficiency on downstream few-shot node and graph classification tasks compared with 15 state-of-the-art baselines.

📄 PDF Abstract BibTeX arXiv:2511.05592

Code (0)

등록된 구현이 없습니다.

Tasks

Graph ClassificationGraph Similarity

Similar Papers 제목 키워드 기반

Towards Foundation Models for Knowledge Graph Reasoning

2023-10-06 · Mikhail Galkin, Xinyu Yuan, Hesham Mostafa, Jian Tang 외

Foundation models in language and vision have the ability to run inference on any textual and visual inputs thanks to the transferable representations such as a vocabulary of tokens in language. Knowledge graphs (KGs) ha…

Knowledge GraphsLink PredictionRelation

A Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation

2026-06-02 · Ankang Yang, Jitao Zhao, Dongxiao He, Liang Yang 외 arxiv

Graph foundation models aim to learn transferable knowledge from diverse graphs for generalization to unseen graphs and tasks. Unlike text and images, graphs lack a shared vocabulary or regular spatial grid, making cross…

Domain Generalization

GRATE: Temporal Extensions for Inductive KG Foundation Models via Gated Rotary Attention

2026-07-11 · Jiaxin Pan, Osama Mohammed, Daniel Hernández, Steffen Staab arxiv

Knowledge graph foundation models such as Ultra and Trix achieve strong inductive transfer by learning relation-graph representations that generalise to unseen entities and relations. Extending this transferability to te…

Knowledge Graphs

Ruminating Word Representations with Random Noise Masking

2021-01-01 · Hwiyeol Jo, Byoung-Tak Zhang

We introduce a training method for better word representation and performance, which we call \textbf{GraVeR} (\textbf{Gra}dual \textbf{Ve}ctor \textbf{R}umination). The method is to gradually and iteratively add random n…

text-classificationText ClassificationWord Embeddings

How Expressive are Knowledge Graph Foundation Models?

2025-02-18 · Xingyue Huang, Pablo Barceló, Michael M. Bronstein, İsmail İlkan Ceylan 외

Knowledge Graph Foundation Models (KGFMs) are at the frontier for deep learning on knowledge graphs (KGs), as they can generalize to completely novel knowledge graphs with different relational vocabularies. Despite their…

Knowledge GraphsRelation