arXiv Machine Learning

Efficient Memory Crystallization for Graph Learning under Non-Stationary Distribution Shifts

Efficient Memory Crystallization (EMC) is a training‑free, test‑time framework that transforms each incoming graph domain into a compact, semantically faithful memory via a closed‑form distribution‑matching solution. By eliminating the need for auxiliary generative modules, EMC reduces redundant domain information and models inter‑domain dependencies through state‑evolving memories, yielding a tighter generalization error bound. Experiments show EMC outperforms state‑of‑the‑art baselines on non‑stationary graph data, cutting average runtime by 87.4% and GPU memory usage by 92.4% compared to a recent competitor.

arXiv Machine Learning

Aug 31

Temporal Memory-Aware Online Test-Time Adaptation on Dynamic Graphs

The paper introduces DGOTTA, a framework for temporal memory‑aware online test‑time adaptation on dynamic graphs. DGOTTA comprises three modules: temporal‑aware augmentation to diversify test graphs, memory‑aware model prediction to mitigate catastrophic forgetting, and consistency‑guided online adaptation to enforce temporal alignment and smoothness. Experiments on three real‑world datasets and four DGNN backbones show that DGOTTA improves generalization under diverse distribution shifts and across multiple model architectures.

By Bo Li, Xin Zheng, Ming Jin, Can Wang, Shirui Pan

safety

arXiv AI

Jun 11

GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning

arXiv:2510. 04567v3 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) are powerful tools for processing relational data but often struggle to generalize to unseen graphs, giving rise to the development of Graph Foundational Models (GFMs).

By Weishuo Ma, Yanbo Wang, Xiyuan Wang, Lei Zou, Muhan Zhang

llms

arXiv AI

Jun 24

Invariant Graph Representations for Continuous-Time Dynamic Graphs Under Distribution Shifts

arXiv:2405. 19062v2 Announce Type: replace-cross Abstract: Continuous-Time Dynamic Graphs (CTDGs) enable fine-grained modeling of evolving relational systems.

By Lanting Fang, Yulian Yang, Yawei Zhang, Shanshan Feng, Kaiyu Feng, Hanning Yuan

arXiv AI

Jul 14

Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigm

arXiv:2509. 24256v2 Announce Type: replace-cross Abstract: The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets.

By Yunhao Liang, Pujun Zhang, Yuan Qu, Jingyuan Yang, Shaochong Lin, Zuo-jun Max Shen

llms

arXiv AI

Jul 21

DIB-OD: Preserving the Invariant Core for Robust Heterogeneous Graph Adaptation via Decoupled Information Bottleneck and Online Distillation

arXiv:2604. 10882v2 Announce Type: replace-cross Abstract: Graph Neural Network pretraining is pivotal for leveraging unlabeled graph data.

By Yang Yan, Yunxuan Li, Qiuyan Wang, Tianjin Huang, Qiudong Yu

fine-tuning efficiency benchmarks

arXiv Machine Learning

Oct 23

Graph Memory Transformer (GMT)

The paper introduces the Graph Memory Transformer (GMT), a decoder‑only language model that replaces the traditional Feed‑Forward Network sublayer with an explicit learned memory graph. In GMT, token representations are routed through a bank of centroids linked by a directed transition matrix, using gravitational source routing and token‑conditioned target selection to produce gated displacements instead of retrieved values. The resulting model contains 82.2 M parameters, trains stably, and offers direct inspection of centroid usage and transition structure, though it slightly lags a larger GPT‑style baseline in validation loss and perplexity.

By Nicola Zanarini, Niccol\`o Ferrari, Evelina Lamma

llms benchmarks safety

arXiv Machine Learning

Jun 30

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.

By Guiquan Sun, Xikun Zhang, Jingchao Ni, Dongjin Song

benchmarks

arXiv AI

Sep 24

QUARTET: Quad-branch cross-Attention and Random-walk Traces for Enhancing Transformers on Relational Graphs

arXiv:2609.26855v1 Announce Type: cross Abstract: Relational Deep Learning (RDL) models multi-table databases as heterogeneous temporal graphs, and graph transformers currently achieve state-of-the-a...

By Kyaw Hpone Myint, Nan Jiang, Xiang Li, Zhe Wu, Alexandre G. R. Day, Pranab Mohanty, Giri Iyengar

llms benchmarks

arXiv Machine Learning

Oct 15

MAEM: Mitigating Recency Bias via a Replay-Free, Capacity-Controlled Dynamic Mixture of Experts for Class-Incremental Graph Learning

arXiv:2610.20238v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) excel on graph-structured data but suffer catastrophic forgetting when classes arrive sequentially. In class-incremental g...

By Junlin Chen, Wenhao Wang, Junchao Xu, Qingsong Yao, Fei Xue, Li Sun, Xiao Wang, Ruijie Wang

fine-tuning benchmarks safety

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

Hugging Face Trending Papers

Sep 22

QUARTET: Quad-branch cross-Attention and Random-walk Traces for Enhancing Transformers on Relational Graphs

Relational Deep Learning (RDL) models multi-table databases as heterogeneous temporal graphs, and graph transformers currently achieve state-of-the-art performance on benchmarks like RelBench. However...

llms benchmarks

arXiv AI

Jun 17

Handling Feature Heterogeneity with Learnable Graph Patches

arXiv:2606. 17667v1 Announce Type: cross Abstract: In recent years, the rapid development of foundation models and graph pre-training technologies has spurred increasing interest in constructing a universal pre-trained graph model or Graph Foundation Model (GFM).

By Yifei Sun, Yang Yang, Xiao Feng, Zijun Wang, Haoyang Zhong, Chunping Wang, Lei Chen

rag

Related stories