GCAL: Adapting Graph Models to Evolving Domain Shifts
Not on the map. Why?
Abstract (arXiv)
This paper addresses the challenge of graph domain adaptation on evolving, multiple out-of-distribution (OOD) graphs. Conventional graph domain adaptation methods are confined to single-step adaptation, making them ineffective in handling continuous domain shifts and prone to catastrophic forgetting. This paper introduces the Graph Continual Adaptive Learning (GCAL) method, designed to enhance model sustainability and adaptability across various graph domains. GCAL employs a bilevel optimization strategy. The "adapt" phase uses an information maximization approach to fine-tune the model with new graph domains while re-adapting past memories to mitigate forgetting. Concurrently, the "generate memory" phase, guided by a theoretical lower bound derived from information bottleneck theory, involves a variational memory graph generation module to condense original graphs into memories. Extensive experimental evaluations demonstrate that GCAL substantially outperforms existing methods in terms of adaptability and knowledge retention.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 50 of its 68 references that are in the map. First posted on arXiv 22 May 2025.
Builds on
50 of 68 references.
References · 50
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2017Adversarial Discriminative Domain Adaptationcited by 1,311
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 848
- 2019Multi-scale Attributed Node Embeddingcited by 548
- 2022Continual Test-Time Domain Adaptationcited by 525
38 more
- 2022Efficient Test-Time Model Adaptation without Forgettingcited by 469
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 447
- 2016Revisiting Batch Normalization For Practical Domain Adaptationcited by 288
- 2020Graph Information Bottleneckcited by 168
- 2022Handling Distribution Shifts on Graphs: An Invariance Perspectivecited by 164
- 2015Training generative neural networks via Maximum Mean Discrepancy optimizationcited by 151
- 2021Graph Condensation for Graph Neural Networkscited by 150
- 2023All in One: Multi-task Prompting for Graph Neural Networkscited by 148
- 2023EcoTTA: Memory-Efficient Continual Test-time Adaptation via Self-distilled Regularizationcited by 123
- 2022Robust Mean Teacher for Continual and Gradual Test-Time Adaptationcited by 104
- 2022Decorate the Newcomers: Visual Domain Prompt for Continual Test Time Adaptationcited by 98
- 2020Overcoming Catastrophic Forgetting in Graph Neural Networkscited by 95
- 2024All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretrainingcited by 86
- 2021Graph Structure Learning with Variational Information Bottleneckcited by 81
- 2023Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Datacited by 71
- 2019Graph Transfer Learning via Adversarial Domain Adaptation with Graph Convolutioncited by 67
- 2022Empowering Graph Representation Learning with Test-Time Graph Transformationcited by 67
- 2023Graph Prompt Learning: A Comprehensive Survey and Beyondcited by 61
- 2022Graph Condensation via Receptive Field Distribution Matchingcited by 60
- 2024A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensationcited by 57
- 2023CaT: Balanced Continual Graph Learning with Graph Condensationcited by 52
- 2023Structural Re-weighting Improves Graph Domain Adaptationcited by 45
- 2020GraphSAIL: Graph Structure Aware Incremental Learning for Recommender Systemscited by 42
- 2023Continual Learning on Dynamic Graphs via Parameter Isolationcited by 36
- 2022Self-Supervised Continual Graph Learning in Adaptive Riemannian Spacescited by 32
- 2023Graph Condensation for Inductive Node Representation Learningcited by 31
- 2021Hierarchical Prototype Networks for Continual Graph Representation Learningcited by 28
- 2023Semi-supervised Domain Adaptation in Graph Transfer Learningcited by 27
- 2024Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learningcited by 18
- 2024AFDGCF: Adaptive Feature De-correlation Graph Collaborative Filtering for Recommendationscited by 12
- 2024GC-Bench: An Open and Unified Benchmark for Graph Condensationcited by 12
- 2024Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approachcited by 12
- 2024Does Graph Prompt Work? A Data Operation Perspective with Theoretical Analysiscited by 10
- 2021RPT: Toward Transferable Model on Heterogeneous Researcher Data via Pre-Trainingcited by 9
- 2023Adaptive Path-Memory Network for Temporal Knowledge Graph Reasoningcited by 9
- 2024Towards Continuous Reuse of Graph Models via Holistic Memory Diversificationcited by 7
- 2024PRAGA: Prototype-aware Graph Adaptive Aggregation for Spatial Multi-modal Omics Analysiscited by 5
- 2024Single-View Graph Contrastive Learning with Soft Neighborhood Awarenesscited by 2
Built on by
Citing papers per year: 2025: 3; 2026: 5.
8 papers.
- 2025DP-DGAD: A Generalist Dynamic Graph Anomaly Detector with Dynamic Prototypescited by 5
- 2025Simple and Efficient Heterogeneous Temporal Graph Neural Networkcited by 2
- 2026Continual Test-Time Adaptation in Computer Vision: Methods, Benchmarks, and Future Directionscited by 1
- 2025Out-of-Distribution Graph Models Mergingcited by 0
- 2026CGRL: Causal-Guided Representation Learning for Node-Level Out-of-Distribution Generalizationcited by 0
- 2026Online Test-Time Adaptation for Generalizable Dynamic Graph Anomaly Detectioncited by 0
- 2026ReDIL-GNN: Resynthesis Domain Incremental Learning for Circuit Graph Neural Networkscited by 0
- 2026Transfer Learning for Edge Classification on Dynamic Text-Attributed Graphscited by 0
- 2026Transfer Learning for Edge Classification on Dynamic Text-Attributed Graphs26 Sep 2026
- 2026ReDIL-GNN: Resynthesis Domain Incremental Learning for Circuit Graph Neural Networks16 Sep 2026
- 2026Online Test-Time Adaptation for Generalizable Dynamic Graph Anomaly Detection20 Aug 2026
- 2026Continual Test-Time Adaptation in Computer Vision: Methods, Benchmarks, and Future Directions9 Jul 2026
- 2026CGRL: Causal-Guided Representation Learning for Node-Level Out-of-Distribution Generalization25 Mar 2026
- 2025Simple and Efficient Heterogeneous Temporal Graph Neural Network21 Oct 2025
- 2025DP-DGAD: A Generalist Dynamic Graph Anomaly Detector with Dynamic Prototypes1 Aug 2025
- 2025Out-of-Distribution Graph Models Merging4 Jun 2025