Train Your Own GNN Teacher: Graph-Aware Distillation on Textual Graphs
Abstract
How can we learn effective node representations on textual graphs? Graph Neural Networks (GNNs) that use Language Models (LMs) to encode textual information of graphs achieve state-of-the-art performance in many node classification tasks. Yet, combining GNNs with LMs has not been widely explored for practical deployments due to its scalability issues. In this work, we tackle this challenge by developing a Graph-Aware Distillation framework (GraD) to encode graph structures into an LM for graph-free, fast inference. Different from conventional knowledge distillation, GraD jointly optimizes a GNN teacher and a graph-free student over the graph's nodes via a shared LM. This encourages the graph-free student to exploit graph information encoded by the GNN teacher while at the same time, enables the GNN teacher to better leverage textual information from unlabeled nodes. As a result, the teacher and the student models learn from each other to improve their overall performance. Experiments in eight node classification benchmarks in both transductive and inductive settings showcase GraD 's superiority over existing distillation approaches for textual graphs. Our code is available at:.
Benchmark Results
Tested on 1 dataset 2 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
OGB
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Jacobi | 0.8968 | |
| 2 | GPR | 0.8953 | |
| 3 | LEMP4HG | 0.8939 | |
| 4 | SAGE | 0.8933 | |
| 16 | GLEM-GNN | 0.8736
±0.0007 best reported | best at pub: Learning on Large-scale Text-attributed Graphs via Variational Inference (ICLR 2022) |
| 15 | GLEM | 0.8736
±0.0007 best reported | best today: SimTeG: A Frustratingly ple Approach Improves xtual raph Learning (2023) |
| 18 | GraD-BERT + SAGN+ | 0.8692
±0.0007 | This paper |
| 37 | OGB-feat + GraD-BERT | 0.8551
±0.0051 | This paper |
| 44 | OGB-feat + SAGN+ | 0.8485
±0.0010 | This paper |
| 60 | GIANT + GraD-BERT | 0.8415
±0.0015 | This paper |
| 74 | GraD-GNN | 0.8334
±0.0024 | This paper |
| 76 | GLEM + GraD-BERT | 0.8316
±0.0019 | This paper |
| 81 | JKD | 0.8289
±0.0007 | This paper |
| 88 | GA-BERT-GNN | 0.8235 | This paper |
| 89 | GA-BERT + GraD-BERT | 0.8235 | This paper |
| 98 | BERT-GNN | 0.8201
±0.0043 | This paper |
| 102 | BERT+KD | 0.8191
±0.0064 | This paper |
| 113 | Joint | 0.8142
±0.0040 | This paper |
| 116 | BERT + GraD-BERT | 0.8124 | This paper |
| 122 | E2EG | 0.8111
±0.0037 | This paper |
| 137 | GIANT | 0.8049
±0.0028 | This paper |
| 222 | GLNN | 0.7765
±0.0048 | prev best: Efficient Graph Neural Network Inference at Large Scale (2022) |
| 223 | BERT | 0.7764
±0.0008 | prev best: Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction (ICLR 2021) |
| 304 | BERT-LP | 0.7383
±0.0006 | This paper |
| 351 | MLP | 0.6605
±0.0020 best reported | best at pub: SCR: Training Graph Neural Networks with Consistency Regularization (2021) best today: Latent Graph Inference using Product Manifolds (ICLR 2022) |
