arXiv:2607. 10159v1 Announce Type: new Abstract: In real-world multimodal web scenarios, graph-structured data often arrives in a streaming manner, making graph continual learning a crucial paradigm for continuously modeling such evolving structures.
By Tairan Huang, Yili Wang, Beibei Hu, Yiting Shi, Qiutong Li, Changlong He, Jianliang Gao
arXiv:2606. 01873v1 Announce Type: new Abstract: LLM-as-Aligner has emerged as a prevalent pre-training paradigm for Text-Attributed Graphs(TAGS), aligning graph and text modalities into a shared embedding space via CLIP-style contrastive learning.
By Yuhan Wang, Yibo Ding, Yutong Ye, Mufan Zhao, Wenbo Zhang, Ruijie Wang, Jianxin Li
arXiv:2607. 11112v1 Announce Type: new Abstract: Dynamic graph continual learning (DGCL) is an effective manner for handling catastrophic forgetting in dynamic graphs.
By Tingxu Yan Ye Yuan
arXiv:2607. 03587v1 Announce Type: new Abstract: We propose NetinfoGC, a framework for graph classification that extends the Network Usable Information (NUI) paradigm to graph-level learning.
By Abdullah Shaik, Anwar Said
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
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
The paper introduces Multiple Embedding Replay Selection (MERS), a graph‑based method that combines supervised and self‑supervised embeddings to improve sample selection for replay buffers in continual learning. MERS replaces traditional buffer selection modules and demonstrates consistent performance gains over state‑of‑the‑art strategies, especially in low‑memory settings. Experiments on CIFAR‑100 and TinyImageNet show that MERS outperforms single‑embedding baselines without adding model parameters or increasing replay volume, making it a practical, drop‑in enhancement for replay‑based continual learning.
By Danit Yanowsky, Daphna Weinshall
arXiv:2607. 17272v1 Announce Type: new Abstract: Node representation learning has advanced rapidly, yet most existing methods rely on per-dataset training and hyperparameter tuning.
By Dooho Lee, Jaemin Yoo
arXiv:2607.11577v2 Announce Type: replace-cross
Abstract: Conventional Graph Neural Networks (GNNs) couple feature transformation and neighborhood aggregation, which often renders them vulnerable to...
By Chengcheng Yan, Feifei Zhao, Dai Zhu, Wei Liu, Qingsong Wang
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
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
arXiv:2608. 04381v1 Announce Type: cross Abstract: Self-supervised learning on graphs is largely shaped by contrastive methods that depend on carefully designed augmentations, and by generative methods that reconstruct node attributes in the input space.
By Tinghe Zhang, Jian Xu, Jiaheng Chen, Jiaxing Li, Yucheng Xiao, Qiang Wang