arXiv Machine Learning By Poupak Azad, Cuneyt Gurcan Akcora, Kiarash Shamsi

Edge Sparsification via Temporal Forman-Ricci Curvature for Dynamic Graph Learning

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

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
arXiv Machine Learning
1d ago

Information propagation dynamics in Deep Graph Networks

The paper explores how information propagates in Deep Graph Networks (DGNs) for both static and dynamic graphs, treating DGNs as dynamical systems. It presents new architectures that better preserve long‑term node dependencies and learn complex spatio‑temporal patterns from irregular, sparsely sampled dynamic graphs. The work combines theoretical analysis with empirical results to demonstrate the effectiveness of these designs.

By Alessio Gravina
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