Unleashing the potential of GNNs via Bi-directional Knowledge Transfer
Not on the map. Why?
Abstract (arXiv)
Based on the message-passing paradigm, there has been an amount of research proposing diverse and impressive feature propagation mechanisms to improve the performance of GNNs. However, less focus has been put on feature transformation, another major operation of the message-passing framework. In this paper, we first empirically investigate the performance of the feature transformation operation in several typical GNNs. Unexpectedly, we notice that GNNs do not completely free up the power of the inherent feature transformation operation. By this observation, we propose the Bi-directional Knowledge Transfer (BiKT), a plug-and-play approach to unleash the potential of the feature transformation operations without modifying the original architecture. Taking the feature transformation operation as a derived representation learning model that shares parameters with the original GNN, the direct prediction by this model provides a topological-agnostic knowledge feedback that can further instruct the learning of GNN and the feature transformations therein. On this basis, BiKT not only allows us to acquire knowledge from both the GNN and its derived model but promotes each other by injecting the knowledge into the other. In addition, a theoretical analysis is further provided to demonstrate that BiKT improves the generalization bound of the GNNs from the perspective of domain adaption. An extensive group of experiments on up to 7 datasets with 5 typical GNNs demonstrates that BiKT brings up to 0.5% - 4% performance gain over the original GNN, which means a boosted GNN is obtained. Meanwhile, the derived model also shows a powerful performance to compete with or even surpass the original GNN, enabling us to flexibly apply it independently to some other specific downstream tasks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 44 of its 57 references that are in the map. First posted on arXiv 26 Oct 2023.
Builds on
44 of 57 references.
References · 44
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2019Simplifying Graph Convolutional Networkscited by 1,477
- 2018Relational inductive biases, deep learning, and graph networkscited by 1,360
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
32 more
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
- 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,082
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 680
- 2019Neural Graph Collaborative Filteringcited by 661
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
- 2021Data-Free Knowledge Distillation for Heterogeneous Federated Learningcited by 383
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 362
- 2020SIGN: Scalable Inception Graph Neural Networkscited by 284
- 2021GRAND: Graph Neural Diffusioncited by 258
- 2018Modeling polypharmacy side effects with graph convolutional networkscited by 237
- 2020Graph Random Neural Network for Semi-Supervised Learning on Graphscited by 213
- 2020Data Augmentation for Graph Neural Networkscited by 203
- 2021Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillationcited by 152
- 2021Graph Learning: A Surveycited by 141
- 2019Mode Seeking Generative Adversarial Networks for Diverse Image Synthesiscited by 138
- 2019Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labelscited by 111
- 2022Periodic Graph Transformers for Crystal Material Property Predictioncited by 87
- 2022Graph Attention Multi-Layer Perceptroncited by 83
- 2020Robust Optimization as Data Augmentation for Large-scale Graphscited by 58
- 2021Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoodscited by 58
- 2022Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPscited by 42
- 2022Multi-modal Graph Learning for Disease Predictioncited by 34
- 2022MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initializationcited by 31
- 2020On Graph Neural Networks versus Graph-Augmented MLPscited by 30
- 2022Neural Structured Prediction for Inductive Node Classificationcited by 13
- 2022Teaching Yourself: Graph Self-Distillation on Neighborhood for Node Classificationcited by 6
Built on by
Not cited yet.