arXiv:2607. 21885v1 Announce Type: new Abstract: Coarsening-based training for graph neural networks (GNNs), i.
By Guoming Li, Jian Yang, Xukun Wang, Zixiao Wang, Shangsong Liang, Yifan Chen
arXiv:2608. 02128v1 Announce Type: new Abstract: Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers.
By Antonin Joly, Nicolas Keriven, Aline Roumy
arXiv:2602. 01553v3 Announce Type: replace-cross Abstract: Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies.
By Quang Truong, Yu Song, Donald Loveland, Mingxuan Ju, Tong Zhao, Neil Shah, Jiliang Tang
arXiv:2609.25781v1 Announce Type: new
Abstract: Graph Incremental Learning has garnered increasing attention as dynamic graph data continues to emerge across diverse fields. Conventional approaches p...
By Zihan Mei, Zhili Qin, Tongze Zhang, Hongyuan Liu, Junming Shao, Qinli Yang
Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers. We show that several existing scalable approaches can be written as structured modifications of the GNN propagation matrix, providing a unified perspective that exposes their respective limitations.
HERO is a heterogeneous continual graph learning framework that preserves historical knowledge at both structural and semantic levels while adapting to new tasks. It uses DiSCo to select representative target nodes and reconstruct compact heterogeneous contexts, and applies multi-level knowledge distillation to align task-conditioned predictions with semantic responses. Experiments on four datasets with three HGNN backbones show HERO achieves best or tied-best average performance while maintaining competitive forgetting.
By Guiquan Sun, Xikun Zhang, Jingchao Ni, Dongjin Song