Curriculum Dynamic Graph Invariant Learning under Distribution Shift
Zizhao Zhang, Haoyang Li, Zeyang Zhang, Ziwei Zhang, Yuan Meng, Xin Wang, Wenwu Zhu
OpenReview ground truth
Abstract
Dynamic graph neural networks have attracted intensive research interests recently but generally suffer from handling distribution shifts that widely exist in dynamic graphs. Although the existing works attempt to disentangle the invariant and variant patterns, they ignore the training status of the graph neural network and the importance of training samples at different times, which are critical to model invariant patterns accurately in dynamic graphs under distribution shifts. In this paper, we study distribution shifts in dynamic graphs with curriculum learning for the first time, which remains unexplored and faces the following challenges: (i) how to design a tailored training status evaluation strategy; and (ii) how to design a tailored sample importance reweighting strategy, so as to handle distribution shifts in dynamic graphs. To address these challenges, we propose a Curriculum Dynamic Graph Invariant Learning (CDGIL) model, which can handle distribution shifts in dynamic graphs by capturing and utilizing invariant and variant patterns guided by the proposed curriculum learning strategy. Specifically, we first propose a dual disentangled dynamic attention network to capture the invariant and variant patterns, respectively. Next, we propose a self-paced intervention mechanism based on training status to create adversarial samples by reassembling variant patterns across neighborhoods and time stamps to remove the spurious impacts of variant patterns. Finally, we propose a sample importance reweighting strategy to distinguish invariant and variant patterns better via focusing on the key training samples. Extensive experiments on both synthetic and real-world dynamic graph datasets demonstrate the superiority of our proposed method over state-of-the-art baselines under distribution shifts.
Author context
Most prolific author: 5 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 36 comparisons
Ranked above opponent in 42% of matchups.
- ▲ beat DEEP UNSUPERVISED DOMAIN ADAPTATION FOR TI… ×6
- ▲ beat From Cluster Assumption to Graph Convoluti… ×4
- ▼ lost to Towards the Universal Learning Principle f… ×4
- ▼ lost to THOUGHT PROPAGATION: AN ANALOGICAL APPROAC… ×4
- ▼ lost to Calibration Bottleneck: What Makes Neural … ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 36)