arXiv Machine Learning

DRIFT: A Benchmark for Task-Free Continual Graph Learning with Continuous Distribution Shifts

arXiv:2605. 12998v3 Announce Type: replace Abstract: Continual graph learning (CGL) aims to learn from dynamically evolving graphs while mitigating catastrophic forgetting.

arXiv AI
Sep 25

Beyond Static Graph World Models: Learning Stochastic Latent Dynamics over Evolving Topologies

The paper introduces the Graph Dynamics Model (GDM), a world model that learns stochastic latent dynamics over evolving graph topologies. GDM employs a sparse recurrent adjacency matrix for topology updates and a recurrent state‑space architecture for stochastic transitions, enabling it to handle partially observable, stochastic environments. The authors also propose the Graph Distribution Distance (GDD) metric, using maximum mean discrepancy with a graph kernel, to compare predicted and true joint graph state distributions, and demonstrate GDM’s superior performance and zero‑shot generalisation on large graphs.

By Alex Schutz, Nick Hawes, Victor-Alexandru Darvariu