GNN-as-Judge: Unleashing the Power of LLMs for Graph Learning with GNN Feedback

• URL: http://arxiv.org/abs/2604.08553v1
• Date: Wed, 11 Mar 2026 21:14:33 GMT
• Title: GNN-as-Judge: Unleashing the Power of LLMs for Graph Learning with GNN Feedback
• Abstract summary: Large Language Models (LLMs) have shown strong performance on text-attributed graphs (TAGs)<n>This paper targets two key challenges: (i) the difficulty of generating and selecting reliable pseudo labels on TAGs for LLMs, and (ii) the need to mitigate potential label noise when fine-tuning LLMs with pseudo labels.<n>We propose a new framework, GNN-as-Judge, which can unleash the power of LLMs for few-shot semi-supervised learning on TAGs.
• Score: 29.323513184371222
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Large Language Models (LLMs) have shown strong performance on text-attributed graphs (TAGs) due to their superior semantic understanding ability on textual node features. However, their effectiveness as predictors in the low-resource setting, where labeled nodes are severely limited and scarce, remains constrained since fine-tuning LLMs usually requires sufficient labeled data, especially when the TAG shows complex structural patterns. In essence, this paper targets two key challenges: (i) the difficulty of generating and selecting reliable pseudo labels on TAGs for LLMs, and (ii) the need to mitigate potential label noise when fine-tuning LLMs with pseudo labels. To counter the challenges, we propose a new framework, GNN-as-Judge, which can unleash the power of LLMs for few-shot semi-supervised learning on TAGs by incorporating the structural inductive bias of Graph Neural Networks (GNNs). Specifically, GNN-as-Judge introduces a collaborative pseudo-labeling strategy that first identifies the most influenced unlabeled nodes from labeled nodes, then exploits both the agreement and disagreement patterns between LLMs and GNNs to generate reliable labels. Furthermore, we develop a weakly-supervised LLM fine-tuning algorithm that can distill the knowledge from informative pseudo labels while mitigating the potential label noise. Experiments on multiple TAG datasets demonstrate that GNN-as-Judge significantly outperforms existing methods, particularly in low-resource regimes where labeled data are scarce.

Related papers

• Dynamic Bundling with Large Language Models for Zero-Shot Inference on Text-Attributed Graphs [56.73437142790496]
  Large language models (LLMs) have been used in many zero-shot learning problems.<n>LLMs struggle with text attributes isolated from the graph topology.<n>They yield unreliable predictions due to both information insufficiency and the inherent weakness of LLMs.
  arXiv  Detail & Related papers  (2025-05-23T08:12:16Z)
• Few-Shot Graph Out-of-Distribution Detection with LLMs [34.42512005781724]
  We propose a framework that combines the strengths of large language models (LLMs) and graph neural networks (GNNs) to enhance data efficiency in graph out-of-distribution (OOD) detection.<n>We show that LLM-GOOD significantly reduces human annotation costs and outperforms state-of-the-art baselines in terms of both ID classification accuracy and OOD detection performance.
  arXiv  Detail & Related papers  (2025-03-28T02:37:18Z)
• Leveraging Large Language Models for Effective Label-free Node Classification in Text-Attributed Graphs [10.538099379851198]
  Locle is an active self-training framework that does Label-free node Classification with LLMs cost-Effectively.<n>It iteratively identifies small sets of "critical" samples using GNNs and extracts informative pseudo-labels for them with both LLMs and GNNs.<n>It significantly outperforms state-of-the-art methods under the same query budget to LLMs in terms of label-free node classification.
  arXiv  Detail & Related papers  (2024-12-16T17:04:40Z)
• GL-Fusion: Rethinking the Combination of Graph Neural Network and Large Language model [63.774726052837266]
  We introduce a new architecture that deeply integrates Graph Neural Networks (GNNs) with Large Language Models (LLMs)<n>We introduce three key innovations: (1) Structure-Aware Transformers, which incorporate GNN's message-passing capabilities directly into LLM's transformer layers; (2) Graph-Text Cross-Attention, which processes full, uncompressed text from graph nodes and edges; and (3) GNN-LLM Twin Predictor, enabling LLM's flexible autoregressive generation alongside GNN's scalable one-pass prediction.
  arXiv  Detail & Related papers  (2024-12-08T05:49:58Z)
• Training a Label-Noise-Resistant GNN with Reduced Complexity [19.032199712090485]
  Graph Neural Networks (GNNs) have been widely employed for semi-supervised node classification tasks on graphs. The performance of GNNs is significantly affected by label noise, that is, a small amount of incorrectly labeled nodes can substantially misguide model training. We introduce the Label Ensemble Graph Neural Network (LEGNN), a lower complexity method for robust GNNs training against label noise.
  arXiv  Detail & Related papers  (2024-11-17T09:52:20Z)
• Zero-to-Strong Generalization: Eliciting Strong Capabilities of Large Language Models Iteratively without Gold Labels [75.77877889764073]
  Large Language Models (LLMs) have demonstrated remarkable performance through supervised fine-tuning or in-context learning using gold labels. This study explores whether solely utilizing unlabeled data can elicit strong model capabilities. We propose a new paradigm termed zero-to-strong generalization.
  arXiv  Detail & Related papers  (2024-09-19T02:59:44Z)
• All Against Some: Efficient Integration of Large Language Models for Message Passing in Graph Neural Networks [51.19110891434727]
  Large Language Models (LLMs) with pretrained knowledge and powerful semantic comprehension abilities have recently shown a remarkable ability to benefit applications using vision and text data. E-LLaGNN is a framework with an on-demand LLM service that enriches message passing procedure of graph learning by enhancing a limited fraction of nodes from the graph.
  arXiv  Detail & Related papers  (2024-07-20T22:09:42Z)
• Label-free Node Classification on Graphs with Large Language Models (LLMS) [46.937442239949256]
  This work introduces a label-free node classification on graphs with Large Language Models pipeline, LLM-GNN. Itates the strengths of both GNNs and LLMs while mitigating their limitations. In particular, LLM-GNN can achieve an accuracy of 74.9% on a vast-scale dataset with a cost less than 1 dollar.
  arXiv  Detail & Related papers  (2023-10-07T03:14:11Z)
• Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning [51.90524745663737]
  A key innovation is our use of explanations as features, which can be used to boost GNN performance on downstream tasks. Our method achieves state-of-the-art results on well-established TAG datasets. Our method significantly speeds up training, achieving a 2.88 times improvement over the closest baseline on ogbn-arxiv.
  arXiv  Detail & Related papers  (2023-05-31T03:18:03Z)
• NRGNN: Learning a Label Noise-Resistant Graph Neural Network on Sparsely and Noisily Labeled Graphs [20.470934944907608]
  Graph Neural Networks (GNNs) have achieved promising results for semi-supervised learning tasks on graphs such as node classification. Many real-world graphs are often sparsely and noisily labeled, which could significantly degrade the performance of GNNs. We propose to develop a label noise-resistant GNN for semi-supervised node classification.
  arXiv  Detail & Related papers  (2021-06-08T22:12:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.