CacheDyG introduces a cache‑refine framework that decouples temporal propagation from parameter updates in dynamic graph neural networks. By storing graph‑aware node‑time representations in non‑trainable buffers and updating only a lightweight refiner, residual gate, and link predictor during training, it reduces repeated recomputation of historical structures. Experiments on five benchmarks show that CacheDyG uses fewer trainable parameters, runs faster, and achieves competitive or better predictive performance compared to existing baselines.
arXiv:2607. 05095v1 Announce Type: new Abstract: Temporal Graph Neural Networks (TGNNs) are widely used for learning from dynamic graphs in applications such as recommendation, social network analysis, and traffic forecasting.
arXiv:2504. 07337v2 Announce Type: replace Abstract: Aggregating temporal signals from historic interactions is a key step in future link prediction on dynamic graphs.
arXiv:2510. 09416v4 Announce Type: replace Abstract: Learning on temporal graphs has become a central topic in graph representation learning, with numerous benchmarks indicating the strong performance of state-of-the-art models.
arXiv:2602. 14239v3 Announce Type: replace-cross Abstract: Predicting links in sparse, continuously evolving networks is a central challenge in network science.
arXiv:2609.05862v1 Announce Type: new Abstract: Learning on dynamic graphs is difficult when changes in the underlying network are only partially observed. Acquiring current graph information incurs...
arXiv:2607. 18412v1 Announce Type: new Abstract: Dynamic graph learning aims to capture evolving structural and semantic patterns in real-world systems, such as fraud detection and recommender systems.
arXiv:2607. 11112v1 Announce Type: new Abstract: Dynamic graph continual learning (DGCL) is an effective manner for handling catastrophic forgetting in dynamic graphs.
arXiv:2608. 07158v1 Announce Type: new Abstract: Temporal graph learning has become essential for analyzing real-world systems whose interactions continuously evolve over time, including financial transaction networks, communication systems, and online social platforms.
Modeling multivariate time series by representing them as graphs, where individual series act as nodes and pairwise temporal corre- lations serve as edges, has gained significant traction. Recent advances in Graph Neural Networks (GNNs) have demonstrated strong perfor- mance by assuming a static graph topology and aggregating information from neighboring series.
arXiv:2607. 17272v1 Announce Type: new Abstract: Node representation learning has advanced rapidly, yet most existing methods rely on per-dataset training and hyperparameter tuning.
SiST‑GNN introduces a simultaneous spatial‑temporal message‑passing framework for dynamic graph neural networks, fusing per‑node temporal embeddings with spatial aggregation in a single operation. By maintaining a recurrent hidden state per node and treating it as a cross‑time edge, the model jointly reasons over topology and evolution. Experiments on link‑prediction and node‑classification benchmarks show significant improvements over prior methods, achieving up to 158% gains in live‑update link prediction and outperforming discrete‑time baselines by 7–23% in dynamic node classification.
arXiv:2608. 07333v1 Announce Type: new Abstract: Modeling multivariate time series by representing them as graphs, where individual series act as nodes and pairwise temporal corre- lations serve as edges, has gained significant traction.