STRIDE: Structure and Embedding Distillation with Attention for Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Recent advancements in Graph Neural Networks (GNNs) have led to increased model sizes to enhance their capacity and accuracy. Such large models incur high memory usage, latency, and computational costs, thereby restricting their inference deployment. GNN compression techniques compress large GNNs into smaller ones with negligible accuracy loss. One of the most promising compression techniques is knowledge distillation (KD). However, most KD approaches for GNNs only consider the outputs of the last layers and do not consider the outputs of the intermediate layers of the GNNs. The intermediate layers may contain important inductive biases indicated by the graph structure and embeddings. Ignoring these layers may lead to a high accuracy drop, especially when the compression ratio is high. To address these shortcomings, we propose a novel KD approach for GNN compression that we call Structure and Embedding Distillation with Attention (STRIDE). STRIDE utilizes attention to identify important intermediate teacher-student layer pairs and focuses on using those pairs to align graph structure and node embeddings. We evaluate STRIDE on several datasets, such as OGBN-Mag and OGBN-Arxiv, using different model architectures, including GCNIIs, RGCNs, and GraphSAGE. On average, STRIDE achieves a 2.13% increase in accuracy with a 32.3X compression ratio on OGBN-Mag, a large graph dataset, compared to state-of-the-art approaches. On smaller datasets (e.g., Pubmed), STRIDE achieves up to a 141X compression ratio with the same accuracy as state-of-the-art approaches. These results highlight the effectiveness of focusing on intermediate-layer knowledge to obtain compact, accurate, and practical GNN models.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 21 of its 49 references that are in the map. First posted on arXiv 24 Oct 2023.
Builds on
21 of 49 references.
References · 21
- 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
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
- 2014FitNets: Hints for Thin Deep Netscited by 1,619
- 2016Paying More Attention to Attention: Improving the Performance of Convolutional Neural Networks via Attention Transfercited by 1,059
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2020Point-GNN: Graph Neural Network for 3D Object Detection in a Point Cloudcited by 335
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 163
9 more
- 2020Distilling Knowledge from Graph Convolutional Networkscited by 128
- 2021Show, Attend and Distill:Knowledge Distillation via Attention-based Feature Matchingcited by 76
- 2019Spam Review Detection with Graph Convolutional Networkscited by 57
- 2021Accelerating Large Scale Real-Time GNN Inference using Channel Pruningcited by 41
- 2023Knowledge Distillation on Graphs: A Surveycited by 38
- 2020GRIP: A Graph Neural Network Accelerator Architecturecited by 37
- 2022Compressing Deep Graph Neural Networks via Adversarial Knowledge Distillationcited by 18
- 2022SA-MLP: Distilling Graph Knowledge from GNNs into Structure-Aware MLPcited by 12
- 2023MS-BioGraphs: Sequence Similarity Graph Datasetscited by 1
Built on by
Citing papers per year: 2024: 1.
1 paper.