arXiv AI
Aug 28

Rethinking Message Passing as Retrieval for Text-Attributed Graph Learning

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
arXiv Machine Learning
Oct 7

Complementary Supervised and Self-Supervised Representations for Out-of-Distribution Graph Learning

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 Machine Learning
Aug 4

Nonlinear Laplacians Improve Signed-Directed Graph Learning

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