TRACI: A Data-centric Approach for Multi-Domain Generalization on Graphs
Yusheng Zhao, Changhu Wang, Xiao Luo, Junyu Luo, Wei Ju, Zhiping Xiao, Ming Zhang
Abstract
Graph neural networks (GNNs) have gained superior performance in graph-based prediction tasks with a variety of applications such as social analysis and drug discovery. Despite the remarkable progress, their performance often degrades on test graphs with distribution shifts. Existing domain adaptation methods rely on unlabeled test graphs during optimization, limiting their applicability to graphs in the wild. Towards this end, this paper studies the problem of multi-domain generalization on graphs, which utilizes multiple source graphs to learn a GNN with high performance on unseen target graphs. We propose a new approach named Topological Adversarial Learning with Prototypical Mixup (TRACI) to solve the problem. The fundamental principle behind our TRACI is to produce virtual adversarial and mixed graph samples from a data-centric view. In particular, TRACI enhances GNN generalization by employing a gradient-ascent strategy that considers both label prediction entropy and graph topology to craft challenging adversarial samples. Additionally, it generates domain-agnostic node representations by characterizing class-graph pair prototypes through latent distributions and applying multi-sample prototypical Mixup for distribution alignment across graphs. We further provide theoretical analysis showing that TRACI reduces the model's excess risk. Extensive experiments on various benchmark datasets demonstrate that TRACI outperforms state-of-the-art baselines, validating its effectiveness.
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 efa93900-120f-4fdd-8e8c-b8be3286d253Cited by top-tier papers2
- Rethinking Graph Generalization through the Lens of Sharpness-Aware MinimizationYang Qiu, Yixiong Zou, Jun WangWWW 2026
- Sample Lottery: Unsupervised Discovery of Critical Instances for LLM ReasoningZhiping Xiao, Yusheng Zhao, Qixin Zhang, Jiaye Xie et al.ICLR 2026
Builds on25
- Supervised Contrastive LearningPrannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna et al.NeurIPS 2020 · 7,049 citations
- Simple and Deep Graph Convolutional NetworksMing Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding et al.ICML 2020 · 1,910 citations
- Understanding and Improving Fast Adversarial TrainingMaksym Andriushchenko, Nicolas FlammarionNeurIPS 2020 · 366 citations
- Handling Distribution Shifts on Graphs: An Invariance PerspectiveQitian Wu, Hengrui Zhang, Junchi Yan, David WipfICLR 2022 · 261 citations
- G-Mixup: Graph Data Augmentation for Graph ClassificationXiaotian Han, Zhimeng Jiang, Ninghao Liu, Xia HuICML 2022 · 251 citations
Related papers
- Can Modifying Data Address Graph Domain Adaptation?Renhong Huang, Jiarong Xu, Xin Jiang, Ruichuan An et al.KDD 2024 · 1 citation
- DREAM: Dual Structured Exploration with Mixup for Open-set Graph Domain AdaptionNan Yin, Mengzhu Wang, Zhenghan Chen, Li Shen et al.ICLR 2024 · 28 citations
- MLDGG: Meta-Learning for Domain Generalization on GraphsQin Tian, Chen Zhao, Minglai Shao, Wenjun Wang et al.KDD 2025 · 3 citations
- Rethinking Propagation for Unsupervised Graph Domain AdaptationMeihan Liu, Zeyu Fang, Zhen Zhang, Ming Gu et al.AAAI 2024 · 45 citations
- Graph Out-of-Distribution Generalization via Causal InterventionQitian Wu, Fan Nie, Chenxiao Yang, Tianyi Bao et al.WWW 2024 · 58 citations
