arXiv Machine Learning By Zhuoyi Peng, Hanlin Gu, Lixin Fan, Yi Yang

Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching

Read the original on arXiv Machine Learning →

arXiv:2606. 11583v1 Announce Type: new Abstract: Text-attributed graphs (TAGs) underlie real-world applications such as citation networks, social media, and e-commerce.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 1

Who Should Teach? Confidence-Aware Dual-Teacher Learning for Few-Shot Node Classification on Text-Attributed Graphs

The paper introduces CoTeach, a confidence‑aware dual‑teacher learning framework for few‑shot node classification on text‑attributed graphs. It dynamically chooses between a Graph Neural Network and a Large Language Model as the teacher for each node, based on which source is more reliable for that node. Experiments show that this approach improves classification accuracy while cutting unnecessary use of expensive LLMs.

By Hojin Kim, Sujin Yoon, Sungsu Lim, Dongwon Lee, David Yoon Suk Kang
arXiv Machine Learning
Aug 27

Why Does Graph Learning Fail to Fully Benefit from a Text Teacher?

The paper examines a multimodal approach that combines a self‑supervised GNN encoder with an alternating optimization scheme involving a language‑model teacher. Despite the expectation that this joint strategy would enhance predictive performance, the authors find that the combined model fails to deliver significant gains. They identify six key factors—ranging from anchor strength trade‑offs to misaligned representation spaces—that explain why the integration of text knowledge does not fully benefit graph learning.

By Fumiaki Kimino (SOKENDAI), Ryoma Sato (SOKENDAI, National Institute of Informatics)
arXiv Machine Learning
Sep 7

PACE: Propagation-Aware Collaborative Correction for One-Shot Personalized Federated Graph Learning

PACE introduces a propagation‑aware collaborative correction for one‑shot personalized federated graph learning. Each client sends a rank‑r update and a diagonal sketch of message moments, allowing the server to construct a correction that anchors to the receiver’s local model. A convex negative‑log‑likelihood calibration selects a single coefficient to blend local and external logits, improving accuracy and weighted‑F1 on most datasets while preserving local predictions when the correction is unhelpful.

By Ruizhe Huang, Chengran Li, Xiaochuan Shi
arXiv Machine Learning
Jun 10

When Design Rules Break: Benchmark Composition Determines Whether Label Informativeness Predicts GNN Aggregator Choice

arXiv:2606. 10249v1 Announce Type: new Abstract: We examine whether graph neural network (GNN) design rules generalize across benchmark families by studying aggregator selection (sum, mean, max) on 24 node-classification datasets spanning citation, heterophilic, LINKX Facebook-100, co-purchase, and co-authorship graphs.

By Neha Sharma, Ritesh Sharma