Distilling Graph Geometry: Knowledge Gap from GNNs to MLPs
GNN-to-MLP distillation aims to retain the predictive accuracy of a message-passing teacher while deploying a graph-free MLP at inference. Existing methods mainly transfer node-wise predictions or use confidence-based reweighting, but they do not specify where the student should preserve the teacher's graph-induced geometry. We show that this omission leads to two spectral fail
Reading in Plain English mode — toggle below to switch
GNN-to-MLP distillation aims to retain the predictive accuracy of a message-passing teacher while deploying a graph-free MLP at inference. Existing methods mainly transfer node-wise predictions or use confidence-based reweighting, but they do not specify where the student should preserve the teacher's graph-induced geometry. We show that this omission leads to two spectral fail
This paper addresses critical issues in distilling Graph Neural Networks (GNNs) into simpler Multi-Layer Perceptrons (MLPs) for efficient inference, which is crucial for deploying GNN-powered applications at scale. By identifying and proposing solutions for spectral underfit and overfit, it helps ML engineers build more robust and accurate graph-free models, reducing computational costs and latency in production environments.