GRAVER: Generative Graph Vocabularies for Robust Graph Foundation Models Fine-tuning
Haonan Yuan, Qingyun Sun, Junhua Shi, Xingcheng Fu, Bryan Hooi, Jianxin Li, Philip S. Yu
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c230d455-41f6-4d47-a18b-19213ffb24cfCited by top-tier papers4
- SA²GFM: Enhancing Robust Graph Foundation Models with Structure-Aware Semantic AugmentationJunhua Shi, Qingyun Sun, Haonan Yuan, Xingcheng FuAAAI 2026 · 3 citations
- One for Two: A Unified Framework for Imbalanced Graph Classification via Dynamic Balanced PrototypeGuanjun Wang, Binwu Wang, Jiaming Ma, Zhengyang Zhou et al.ICLR 2026
- Towards Next Graph Token Prediction: Discrete Graph Tokenization for Structural Reasoning in Large Language ModelsZhonghao Wang, Yugang Ji, Zhuonan Zheng, Sheng Zhou et al.KDD 2026
- RAG-GFM: Overcoming In-Memory Bottlenecks in Graph Foundation Models via Retrieval-Augmented GenerationHaonan Yuan, Qingyun Sun, Jiacheng Tao, Xingcheng Fu et al.WWW 2026
Builds on68
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
- Strategies for Pre-training Graph Neural NetworksWeihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik et al.ICLR 2020 · 1,744 citations
- Conditional Prompt Learning for Vision-Language ModelsKaiyang Zhou, Jingkang Yang, Chen Change Loy, Ziwei LiuCVPR 2022 · 1,438 citations
Related papers
- AnomalyGFM: Graph Foundation Model for Zero/Few-shot Anomaly DetectionHezhe Qiao, Chaoxi Niu, Ling Chen, Guansong PangKDD 2025 · 8 citations
- GFMate: Empowering Graph Foundation Models with Test-time Prompt TuningYan Jiang, Ruihong Qiu, Zi HuangICML 2026
- Modality-free Graph In-context AlignmentWei Zhuo, Siqiang LuoICLR 2026 · 2 citations
- Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology AlignmentShuo Wang, Bokui Wang, Zhixiang Shen, Boyan Deng et al.ICML 2025
- All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph PretrainingHaihong Zhao, Aochuan Chen, Xiangguo Sun, Hong Cheng et al.KDD 2024 · 35 citations
