Large Language Model Meets Graph Neural Network in Knowledge Distillation
Abstract
Recent advancements in leveraging Large Language Models (LLMs) for Text-Attributed Graphs (TAGs) learning have shown significant potential, but practical deployment is often hindered by substantial computational and storage demands. Conventional Graph Neural Networks (GNNs) are more efficient but struggle with the intricate semantics embedded in TAGs. To combine the semantic understanding of LLMs with the efficiency of GNNs, we propose a novel LLM-to-GNN knowledge distillation framework, istic raph nowledge istillation (LinguGKD), which employs TAG-oriented instruction tuning to train pre-trained LLMs as teachers and introduces a layer-adaptive contrastive distillation strategy to align node features between teacher LLMs and student GNNs within a latent space, effectively transferring the semantic and complex relational understanding from LLMs to GNNs. Extensive experiments across various LLM and GNN architectures on multiple datasets demonstrate that LinguGKD significantly enhances the predictive accuracy and convergence rate of GNNs without requiring additional training data or model parameters. Compared to teacher LLMs, the distilled GNNs offer superior inference speed and reduced resource requirements, making them highly practical for deployment in resource-constrained environments. Furthermore, our framework demonstrates significant potential for leveraging ongoing advancements in LLM research to continuously improve GNN performance.
Benchmark Results
Tested on 1 dataset 2 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
Cora
Global leaderboard →Default metric is Accuracy. The paper reports 19 values on Accuracy and 12 values on F1 .
| # | Model | Accuracy ↑ default | F1 ↑ | Paper |
|---|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±
0.0033 | — | |
| 2 | GCN+CNA | 0.9366
±
0.0048 | — | |
| 3 | TransformerConv | 0.9350
±
0.0058 | — | |
| 8 | GraphSAGE_(Llama3) | 0.9170
±
0.0051 | — | F1
— |
| 9 | GAT_(Llama3) | 0.9151
±
0.0035 | — | F1
— |
| 10 | LinguGraph-Llama3 (8B) | 0.9151
±
0.0046 | — | F1
— |
| 13 | GIN_(Llama3) | 0.9133
±
0.0028 | — | F1
— |
| 17 | GCN_(Llama3) | 0.9077
±
0.0028 | — | F1
— |
| 21 | GCN | 0.9004 best reported | 0.8566
±
0.0078 | F1
0.8566
±
0.0078 best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 25 | ACM-GCN | 0.8975
±
0.0116 | 0.8894
±
0.0054 | F1
0.8894
±
0.0054 |
| 40 | RevGAT | 0.8911
±
0.0000 | 0.8765
±
0.0058 | F1
0.8765
±
0.0058 |
| 39 | SAGE | 0.8911
±
0.0012 | — | |
| 44 | GAT | 0.8897
±0.0014 best reported | 0.8505
±
0.0088 | F1
0.8505
±
0.0088 best at pub: Learned Low Precision Graph Neural Networks (2020) |
| 45 | GCNII | 0.8893
±
0.0137 | 0.8758
±
0.0071 | F1
0.8758
±
0.0071 |
| 50 | FAGCN | 0.8885
±
0.0136 | 0.8792
±
0.0065 | F1
0.8792
±
0.0065 |
| 65 | BernNet | 0.8852
±
0.0095 | 0.8796
±
0.0085 | F1
0.8796
±
0.0085 |
| 84 | LinguGraph-Llama2 (7B) | 0.8819
±
0.0083 | — | F1
— |
| 110 | LinguGraph-Mistral (7B) | 0.8782
±
0.0088 | — | F1
— |
| 141 | GraphSAGE | 0.8708
±0.0085 | 0.8596
±
0.0073 | F1
0.8596
±
0.0073 prev best: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) Improvement within reported uncertainty; not highlighted. |
| 165 | GIN | 0.8660
±0.0091 | 0.8537
±
0.0074 | F1
0.8537
±
0.0074 prev best: Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings (TMLR 2022) |
| 172 | Graphtransformer | 0.8642
±
0.0082 | 0.8596
±
0.0067 | F1
0.8596
±
0.0067 |
| 205 | SGC-v2 | 0.8548
±
0.0148 | 0.8504
±
0.0069 | F1
0.8504
±
0.0069 |
| 456 | Graphormer | 0.8262
±0.0012 best reported | 0.7998
±
0.0056 | F1
0.7998
±
0.0056 best at pub: Language is All a Graph Needs (2023) best today: Toward a Unified Geometry Understanding: Riemannian Diffusion Framework for Graph Generation and Prediction (NeurIPS 2025) |
| 724 | MLP | 0.7768 | — |
