DuoKD: Dual Knowledge Distillation from Large Language Models for Robust Graph Neural Networks
Cuiying Huo, Xiaotong Huang, Dongxiao He, Yixuan Du, Wenhuan Lu, Di Jin
Abstract
Graph neural networks (GNNs) have become a dominant modeling paradigm for graph-structured data, and the emergence of large language models (LLMs) has spurred growing interest in integrating external semantic knowledge into GNNs. Current LLM-based GNNs are devoted to extracting semantically similar information from LLMs to enhance representation learning. However, they generally overlook key signals that are semantically dissimilar but exhibit stronger inter-class discriminative ability. Especially when the original graph data contains noise or semantic ambiguity, a single similarity-based semantic augmentation strategy not only fails to provide effective enhancement, but may also amplify misleading signals generated by the LLM in response to lowquality inputs or its own hallucinations, further degrading the discriminative power and robustness of GNNs. To this end, we propose a dual positive-negative knowledge extraction strategy based on LLMs, and integrate it with a knowledge distillation mechanism to dynamically transfer multidimensional enhanced signals to GNNs, thereby achieving fine-grained and robust graph representation learning. Specifically, we design personalized prompts to guide LLMs in generating semantically similar positive signals and semantically dissimilar negative signals, which help the model capture intra-class consistency and inter-class distinction. Then, we further generate structural and semantic reasoning as supplementary knowledge to support the rationality and guidance of supervision signals. To identify high-confidence transferred knowledge, we introduce a language-based evaluation mechanism to filter low-confidence or hallucinated outputs. Finally, under a unified distillation framework, our method uses both positive and negative knowledge to guide GNN training, achieving adaptive and robust representation learning. Extensive experiments on benchmark datasets verify the superior performance of our approach across various tasks.
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 0739b925-1b0d-4eb0-8b40-4c3b525dbacbBuilds on15
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
- Simple and Deep Graph Convolutional NetworksMing Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding et al.ICML 2020 · 1,910 citations
- GraphSAINT: Graph Sampling Based Inductive Learning MethodHanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan et al.ICLR 2020 · 1,155 citations
- Beyond Low-frequency Information in Graph Convolutional NetworksDeyu Bo, Xiao Wang, Chuan Shi, Huawei ShenAAAI 2021 · 773 citations
Related papers
- Large Language Model Meets Graph Neural Network in Knowledge DistillationShengxiang Hu, Guobing Zou, Song Yang, Shiyi Lin et al.AAAI 2025 · 19 citations
- CCLRec: Consensus-driven Contrastive Learning for LLM-enhanced Graph RecommendationTing Guo, Dongyu Pei, Litiao Qiu, Xiaoying Liao et al.ICML 2026
- Killing Two Birds with One Stone: Cross-modal Reinforced Prompting for Graph and Language TasksWenyuan Jiang, Wenwei Wu, Le Zhang, Zixuan Yuan et al.KDD 2024 · 4 citations
- LLMs Are Noisy Oracles! LLM-based Noise-aware Graph Active Learning for Node ClassificationZeang Sheng, Weiyang Guo, Yingxia Shao, Wentao Zhang et al.KDD 2025 · 1 citation
- Graph Neural Prompting with Large Language ModelsYijun Tian, Huan Song, Zichen Wang, Haozhu Wang et al.AAAI 2024 · 90 citations
