arXiv Machine Learning

TIDFormer: Exploiting Temporal and Interactive Dynamics Makes A Great Dynamic Graph Transformer

arXiv:2506. 00431v2 Announce Type: replace Abstract: Due to the proficiency of self-attention mechanisms (SAMs) in capturing dependencies in sequence modeling, several existing dynamic graph neural networks (DGNNs) utilize Transformer architectures with various encoding designs to capture sequential evolutions of dynamic graphs.

arXiv AI
Sep 7

Dynamic Heterogeneous Graph Representation Learning: A Survey

The article surveys Dynamic Heterogeneous Graph Representation Learning (DHGRL), a field that tackles the challenges of modeling evolving, multi‑type networks. It introduces a unified definition covering both discrete‑time and continuous‑time DHGs, and proposes an algorithm‑centric taxonomy that groups methods into embedding‑based, GNN‑based, and Transformer‑based approaches, highlighting their biases toward temporal granularity. The survey also reviews key applications, datasets, benchmarks, and outlines future research directions.

By Huan Liu, Pengfei Jiao, Jie Yin, Hongjiang Chen, Zhidong Zhao
arXiv Machine Learning
Jul 17

What Do Temporal Graph Learning Models Learn?

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.

By Abigail J. Hayes, Tobias Schumacher, Markus Strohmaier
Hugging Face Trending Papers
Aug 7

When GNNs Fail: Quantifying and Overcoming Temporal Correlation Volatility in Time Series

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 AI
Jul 28

A Survey of Graph Transformers: Architectures, Theories and Applications

arXiv:2502. 16533v3 Announce Type: replace-cross Abstract: Graph Transformers (GTs) have demonstrated a strong capability in modeling graph structures by addressing the intrinsic limitations of graph neural networks (GNNs), such as over-smoothing and over-squashing.

By Chaohao Yuan, Kangfei Zhao, Ercan Engin Kuruoglu, Liang Wang, Tingyang Xu, Wenbing Huang, Deli Zhao, Hong Cheng, Yu Rong
arXiv Machine Learning
Sep 23

CacheDyG: Decoupling Temporal Propagation for Efficient Dynamic Graph Learning

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.

By PinHeng Zong, Ye Yuan