SA²GFM: Enhancing Robust Graph Foundation Models with Structure-Aware Semantic Augmentation
Junhua Shi, Qingyun Sun, Haonan Yuan, Xingcheng Fu
Abstract
While Graph Foundation Models (GFMs) have achieved notable progress across diverse tasks recently, their robustness under domain noise, structural perturbations, and even adversarial attacks remains largely underexplored. A core limitation lies in the inadequate modeling of hierarchical structural semantics, which are intrinsic priors and critical for generalization. In this work, we propose SA 2 GFM, a robust GFM framework that enhances the domain-adaptable representations through Structure-Aware Semantic Augmentation. First, to embed the hierarchical structural priors, we transform entropy-based encoding trees into structure-aware textual prompts for feature augmentation. The enriched inputs are processed by a novel self-supervised Information Bottleneck mechanism that distills the robust and transferable representations through structure-guided compression. To mitigate the negative transfer in cross-domain adaptation, we develop an expert adaptive routing mechanism that integrates a mixture-of-experts architecture with a null expert design. To enable efficient downstream adaptation, we propose a fine-tuning module that efficiently optimizes the hierarchical structures through the joint intra-and inter-community structure learning. Extensive experiments validate the superiority of SA 2 GFM over effectiveness and robustness against random noise and adversarial perturbations on node and graph classification compared with 9 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 03446920-9de1-4b12-b7cb-5d60029b4afaBuilds on23
- 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
- GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural NetworksZemin Liu, Xingtong Yu, Yuan Fang, Xinming ZhangWWW 2023 · 263 citations
- Graph Structural-topic Neural NetworkQingqing Long, Yilun Jin, Guojie Song, Yi Li et al.KDD 2020 · 58 citations
Related papers
- 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
- Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology AlignmentShuo Wang, Bokui Wang, Zhixiang Shen, Boyan Deng et al.ICML 2025
- GRAVER: Generative Graph Vocabularies for Robust Graph Foundation Models Fine-tuningHaonan Yuan, Qingyun Sun, Junhua Shi, Xingcheng Fu et al.NeurIPS 2025 · 17 citations
- Graph Cross-Domain Continual Fine-Tuning via Orthogonal LoRA Routing with Contrastive Expert SpecializationQianyi Cai, Ziyue Qiao, Minghao Yang, Xiao Luo et al.WWW 2026
- How Much Can Transfer? BRIDGE: Bounded Multi-Domain Graph Foundation Model with Generalization GuaranteesHaonan Yuan, Qingyun Sun, Junhua Shi, Xingcheng Fu et al.ICML 2025
