The paper investigates how self‑supervised graph representations can complement supervised ones for out‑of‑distribution (OOD) node classification. Two backbone‑agnostic frameworks are introduced: Co‑Train, which jointly learns and integrates supervised and SSL representations during training, and Dual‑Space Retrieval, which performs non‑parametric prediction in both representation spaces and fuses the results at inference. Experiments on four graph benchmarks with various GNN backbones and SSL objectives (DGI and GRACE) show that Co‑Train consistently outperforms strong supervised OOD baselines, while Dual‑Space Retrieval offers competitive, flexible performance, demonstrating that SSL provides complementary signals that improve OOD node classification.
By Qingying Hao, Zikang Chen, Chuxuan Hu, Jinyuan Jia, Bo Li, Gang Wang, Carl Gunter
Out-of-distribution (OOD) generalization remains challenging for graph neural networks (GNNs), as graph distributions can vary substantially across time and domains. Supervised and self-supervised gra...
PreGS is a multi-expert graph neural network that uses parameter transfer from a pre‑trained multi‑head GAT to freeze GraphSAGE experts, creating complementary structural branches. The model fuses raw node features, GAT head outputs, and expert representations through an MLP, then combines the result with pretrained GAT logits. An extended version, PreGSv2, adds source‑level weighting and a structural gating mechanism for adaptive feature integration, and both variants outperform several baseline GNNs on eight public datasets.
By Zhicong Cai, Yinglong Zhang, Xiaoying Hong, Xuewen Xia, Xing Xu
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
arXiv:2607. 28980v1 Announce Type: new Abstract: Graph Foundation Models (GFMs) have recently emerged as a promising paradigm for enabling knowledge transfer across diverse domains.
By Yi Wang, Jitao Zhao, Di Jin, Dongxiao He
arXiv:2609.37057v1 Announce Type: new
Abstract: Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeat...
By Dooho Lee, Jinmo Lee, Minho Jeong, Kijung Shin, Jaemin Yoo
arXiv:2608. 00491v1 Announce Type: new Abstract: Graph self-supervised learning aims to learn transferable representations from large-scale unlabeled graph data.
By Ruichen Xu, Jingxiang Qu, Wenhan Gao, Jiaxing Zhang, Linsey Pang, Ravid Shwartz-Ziv, Yann LeCun, Yuefan Deng
arXiv:2606. 30291v1 Announce Type: new Abstract: Text-Attributed Graphs (TAGs) combine textual semantics with graph structure and are central to many graph learning tasks.
By Zhifei Hu, Alexandra I. Cristea
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:2607. 11374v1 Announce Type: new Abstract: Graph Foundation Models (GFMs) have emerged as a promising paradigm for learning transferable representations across diverse graph domains.
By Chunyu Hu, Tianyin Liao, Ge Lan, Xingxuan Zhang, Jianxin Li, Peng Cui, Ziwei Zhang
arXiv:2610.02517v1 Announce Type: new
Abstract: Graph-structured data plays a pivotal role in modeling complex relationships. However, real-world graphs are often incomplete due to data collection an...
By Yu Song, Zhigang Hua, Yan Xie, Bingheng Li, Jingzhe Liu, Bo Long, Jiliang Tang, Hui Liu