Glance for Context: Learning When to Leverage LLMs for Node-Aware GNN-LLM Fusion
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 39 of its 54 references that are in the map. First posted on arXiv 12 Oct 2025.
Builds on
39 of 54 references.
References · 39
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,383
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2018A Discourse-Aware Attention Model for Abstractive Summarization of Long Documentscited by 477
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
- 2024A Survey on Mixture of Experts in Large Language Modelscited by 233
- 2021Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networkscited by 182
27 more
- 2022Learning on Large-scale Text-attributed Graphs via Variational Inferencecited by 153
- 2023Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learningcited by 132
- 2021Towards a Unified Framework for Fair and Stable Graph Representation Learningcited by 128
- 2022Universal Prompt Tuning for Graph Neural Networkscited by 100
- 2021GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophilycited by 84
- 2023A Survey of Graph Meets Large Language Model: Progress and Future Directionscited by 84
- 2021Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?cited by 82
- 2020Towards More Practical Adversarial Attacks on Graph Neural Networkscited by 76
- 2023Label-free Node Classification on Graphs with Large Language Models (LLMS)cited by 72
- 2023Graph Mixture of Experts: Learning on Large-Scale Graphs with Explicit Diversity Modelingcited by 63
- 2022Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute Leakagecited by 61
- 2023Amazon-M2: A Multilingual Multi-locale Shopping Session Dataset for Recommendation and Text Generationcited by 42
- 2023Demystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All?cited by 41
- 2015Addressing Complex and Subjective Product-Related Queries with Customer Reviewscited by 28
- 2015Homophily and missing links in citation networkscited by 21
- 2023On Performance Discrepancies Across Local Homophily Levels in Graph Neural Networkscited by 13
- 2017Sequential Prediction of Social Media Popularity with Deep Temporal Context Networkscited by 12
- 2025Exploring Graph Learning Tasks with Pure LLMs: A Comprehensive Benchmark and Investigationcited by 11
- 2024Exploring the Potential of Large Language Models for Heterophilic Graphscited by 10
- 2025Graph-MLLM: Harnessing Multimodal Large Language Models for Multimodal Graph Learningcited by 9
- 2024LOGIN: A Large Language Model Consulted Graph Neural Network Training Frameworkcited by 8
- 2024Lost-in-Distance: Impact of Contextual Proximity on LLM Performance in Graph Taskscited by 8
- 2024Unveiling the Impact of Local Homophily on GNN Fairness: In-Depth Analysis and New Benchmarkscited by 6
- 2024Theoretical and Empirical Insights into the Origins of Degree Bias in Graph Neural Networkscited by 4
- 2024Towards Few-shot Self-explaining Graph Neural Networkscited by 4
- 2024All Against Some: Efficient Integration of Large Language Models for Message Passing in Graph Neural Networkscited by 3
- 2024GT2Vec: Large Language Models as Multi-Modal Encoders for Text and Graph-Structured Datacited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.