Glance for Context: Learning When to Leverage LLMs for Node-Aware GNN-LLM Fusion
Donald Loveland, Yao-An Yang, Danai Koutra
Abstract
Learning on text-attributed graphs has motivated the use of Large Language Models (LLMs) for graph learning. However, most fusion strategies are applied uniformly across all nodes and attain only small overall performance gains. We argue this result stems from aggregate metrics that obscure when LLMs provide benefit, inhibiting actionable signals for new strategies. In this work, we reframe LLM–GNN fusion around nodes where GNNs typically falter. We first show that performance can significantly differ between GNNs and LLMs, with each excelling on distinct structural patterns, such as local homophily. To leverage this finding, we propose GLANCE (GNN with LLM Assistance for Neighbor- and Context-aware Embeddings), a framework that invokes an LLM to refine a GNN's prediction. GLANCE employs a lightweight router that, given inexpensive per-node signals, decides whether to query the LLM. Since the LLM calls are non-differentiable, the router is trained with an advantage-based objective that compares the utility of querying the LLM against relying solely on the GNN. Across multiple benchmarks, GLANCE achieves the best performance balance across node subgroups, achieving significant gains on heterophilous nodes (up to +13%) while simultaneously achieving top overall performance. Our findings highlight the value of adaptive, node-aware GNN-LLM architectures, where selectively invoking the LLM enables scalable deployment on large graphs without incurring high computational costs.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3109e998-ef7e-45f9-bb3a-489fc9808509Cited by top-tier papers1
Ask how each one uses itBuilds on12
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Simple and Deep Graph Convolutional NetworksMing Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding et al.ICML 2020 · 1,910 citations
- Beyond Homophily in Graph Neural Networks: Current Limitations and Effective DesignsJiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann et al.NeurIPS 2020 · 1,490 citations
- Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple MethodsDerek Lim, Felix Hohne, Xiuyu Li, Sijia Linda Huang et al.NeurIPS 2021 · 534 citations
- Universal Prompt Tuning for Graph Neural NetworksTaoran Fang, Yunchao Zhang, Yang Yang, Chunping Wang et al.NeurIPS 2023 · 166 citations
Related papers
- Label-free Node Classification on Graphs with Large Language Models (LLMs)Zhikai Chen, Haitao Mao, Hongzhi Wen, Haoyu Han et al.ICLR 2024 · 103 citations
- Compressing LLM Knowledge into Graph Representations for Text-attributed Graphs LearningRunhuai Chen, Dian Shen, Dandan Zhang, Kaihong Huang et al.ACL 2026
- Leveraging Large Language Models for Effective Label-free Node Classification in Text-Attributed GraphsTaiyan Zhang, Renchi Yang, Yurui Lai, Mingyu Yan et al.SIGIR 2025 · 3 citations
- Preference-driven Knowledge Distillation for Few-shot Node ClassificationXing Wei, Chunchun Chen, Rui Fan, Xiaofeng Cao et al.NeurIPS 2025 · 2 citations
- Generalization Principles for Inference over Text-Attributed Graphs with Large Language ModelsHaoyu Peter Wang, Shikun Liu, Rongzhe Wei, Pan LiICML 2025
