The paper reinterprets graph neural networks (GNNs) as retrieval-augmented models, where each layer uses an MLP on a node representation and a permutation‑invariant summary of retrieved graph context instead of traditional message passing. It introduces RTA, a lightweight MLP‑based framework that replaces structural message passing with label‑aware retrieval and propagation, and provides theoretical links to softmax‑attention message passing and robustness to mis‑retrieved outliers. Experiments on text‑attributed graph benchmarks demonstrate that RTA matches or surpasses strong GNN and graph LLM baselines while improving efficiency and robustness.
By Jintang Li, Yuhong Chen, Ruofan Wu, Binli Luo, Jiayi Ji, Hui Li, Rongrong Ji
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
arXiv:2412. 19419v2 Announce Type: replace-cross Abstract: Graph neural networks are deep neural networks designed for graphs with attributes attached to nodes or edges.
By James H. Tanis, Chris Giannella, Adrian V. Mariano, Daoud Meerzaman
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...
arXiv:2608. 09031v1 Announce Type: new Abstract: Graph neural networks typically propagate information through repeated message-passing layers, coupling the distance over which information travels with the number of nonlinear transformations applied.
By Isuru Herath, Arin Gopakumar, Sharan Sahu
arXiv:2608. 00836v1 Announce Type: new Abstract: While signed-directed graphs have been studied using linear Laplacians in the design of graph neural networks, relatively little research has focused on developing non-linear Laplacian operators for such networks.
By Ali Parviz, Yuichi Yoshida
arXiv:2606. 29773v1 Announce Type: new Abstract: Graphs are widely used to model relational systems, with applications in domains such as social networks, finance, and biomedicine.
By Haoxin Sun, Yiqing Lin, Yajun Huang, Chenhui Dong, Mingjun Li, Zhongzhi Zhang
arXiv:2606. 07475v1 Announce Type: cross Abstract: Node classification in graph neural networks (GNNs) has been widely applied in various fields of graph analysis.
By Takuto Takahashi, Itsuki Nakayama, Takahiro Mitani, Ryosuke Kikuchi, Yuya Sasaki, Makoto Onizuka
arXiv:2505. 13087v2 Announce Type: replace-cross Abstract: We propose a novel benchmarking methodology for graph neural networks (GNNs) based on the graph alignment problem, a combinatorial optimization task that generalizes graph isomorphism by aligning two unlabeled graphs to maximize overlapping edges.
By Adrien Lagesse, Marc Lelarge
arXiv:2502.04312v3 Announce Type: replace
Abstract: Contrastive learning leverages data augmentation to develop feature representation without relying on large labeled datasets. However, despite its...
By Chenghui Li, A. Martina Neuman
Graph-level out-of-distribution (OOD) generalization is critical for deploying graph neural networks in real-world applications where distribution shifts are inevitable. Existing approaches typically...
The paper explores how information propagates in Deep Graph Networks (DGNs) for both static and dynamic graphs, treating DGNs as dynamical systems. It presents new architectures that better preserve long‑term node dependencies and learn complex spatio‑temporal patterns from irregular, sparsely sampled dynamic graphs. The work combines theoretical analysis with empirical results to demonstrate the effectiveness of these designs.
By Alessio Gravina