Shared Growth of Graph Neural Networks via Prompted Free-direction Knowledge Distillation
Not on the map. Why?
Abstract (arXiv)
Knowledge distillation (KD) has shown to be effective to boost the performance of graph neural networks (GNNs), where the typical objective is to distill knowledge from a deeper teacher GNN into a shallower student GNN. However, it is often quite challenging to train a satisfactory deeper GNN due to the well-known over-parametrized and over-smoothing issues, leading to invalid knowledge transfer in practical applications. In this paper, we propose the first Free-direction Knowledge Distillation framework via reinforcement learning for GNNs, called FreeKD, which is no longer required to provide a deeper well-optimized teacher GNN. Our core idea is to collaboratively learn two shallower GNNs to exchange knowledge between them. As we observe that one typical GNN model often exhibits better and worse performances at different nodes during training, we devise a dynamic and free-direction knowledge transfer strategy that involves two levels of actions: 1) node-level action determines the directions of knowledge transfer between the corresponding nodes of two networks; and then 2) structure-level action determines which of the local structures generated by the node-level actions to be propagated. Additionally, considering that different augmented graphs can potentially capture distinct perspectives of the graph data, we propose FreeKD-Prompt that learns undistorted and diverse augmentations based on prompt learning for exchanging varied knowledge. Furthermore, instead of confining knowledge exchange within two GNNs, we develop FreeKD++ to enable free-direction knowledge transfer among multiple GNNs. Extensive experiments on five benchmark datasets demonstrate our approaches outperform the base GNNs in a large margin. More surprisingly, our FreeKD has comparable or even better performance than traditional KD algorithms that distill knowledge from a deeper and stronger teacher GNN.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 71 of its 92 references that are in the map. First posted on arXiv 2 Jul 2023.
Builds on
71 of 92 references.
References · 71
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2017Graph Attention Networkscited by 8,854
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016Layer Normalizationcited by 5,579
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
38 more
- 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2018Deep Graph Infomaxcited by 1,101
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
- 2019When Does Label Smoothing Help?cited by 985
- 2019How Can We Know What Language Models Know?cited by 953
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2016Sequence-Level Knowledge Distillationcited by 761
- 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 686
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2020Contrastive Multi-View Representation Learning on Graphscited by 651
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
- 2019Multi-scale Attributed Node Embeddingcited by 543
- 2017A Brief Survey of Deep Reinforcement Learningcited by 466
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
- 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 312
- 2016Safe, Multi-Agent, Reinforcement Learning for Autonomous Drivingcited by 301
- 2021A Comprehensive Survey on Graph Anomaly Detection with Deep Learningcited by 230
- 2020Graph Random Neural Network for Semi-Supervised Learning on Graphscited by 213
- 2019Graph Neural Networks with convolutional ARMA filterscited by 185
- 2021Self-Supervised Learning of Graph Neural Networks: A Unified Reviewcited by 184
- 2018Adaptive Sampling Towards Fast Graph Representation Learningcited by 180
- 2021Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillationcited by 151
- 2020Distilling Knowledge from Graph Convolutional Networkscited by 128
- 2021Augmentation-Free Self-Supervised Learning on Graphscited by 94
- 2020Non-Local Graph Neural Networkscited by 91
- 2021Graph Neural Networks in Network Neurosciencecited by 91
- 2020Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learningcited by 90
- 2020Line Graph Neural Networks for Link Predictioncited by 89
- 2020Regularizing Neural Networks via Adversarial Model Perturbationcited by 78
- 2021Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Frameworkcited by 69
- 2023RMM: Reinforced Memory Management for Class-Incremental Learningcited by 66
- 2020Reinforced Multi-Teacher Selection for Knowledge Distillationcited by 62
- 2021Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoodscited by 57
- 2021Topology-Imbalance Learning for Semi-Supervised Node Classificationcited by 56
50 most cited of 71 All 71 (JSON)
Built on by
Citing papers per year: 2024: 1.
1 paper.