Towards Better Dynamic Graph Learning: New Architecture and Unified Library
Le Yu, Leilei Sun, Bowen Du, Weifeng Lv

TL;DR
DyGFormer is a novel Transformer-based architecture for dynamic graph learning that effectively captures long-term dependencies using neighbor co-occurrence encoding and patching, supported by a comprehensive library for reproducibility.
Contribution
The paper introduces DyGFormer, a simple yet effective Transformer-based model with a new encoding scheme and patching technique, along with DyGLib, a unified library for dynamic graph research.
Findings
Achieves state-of-the-art results on most datasets.
Effectively models long-term temporal dependencies.
Highlights the importance of standardized evaluation protocols.
Abstract
We propose DyGFormer, a new Transformer-based architecture for dynamic graph learning. DyGFormer is conceptually simple and only needs to learn from nodes' historical first-hop interactions by: (1) a neighbor co-occurrence encoding scheme that explores the correlations of the source node and destination node based on their historical sequences; (2) a patching technique that divides each sequence into multiple patches and feeds them to Transformer, allowing the model to effectively and efficiently benefit from longer histories. We also introduce DyGLib, a unified library with standard training pipelines, extensible coding interfaces, and comprehensive evaluating protocols to promote reproducible, scalable, and credible dynamic graph learning research. By performing exhaustive experiments on thirteen datasets for dynamic link prediction and dynamic node classification tasks, we find that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Bioinformatics and Genomic Networks
