TL;DR
MuGSI introduces a multi-granularity knowledge distillation framework for graph classification, effectively transferring structural information from GNNs to MLPs and enhancing their expressiveness.
Contribution
The paper proposes MuGSI, a novel KD framework with multi-granularity distillation loss and feature augmentation, specifically designed for graph classification tasks.
Findings
MuGSI outperforms baseline methods in accuracy and robustness.
The multi-granularity distillation improves structural knowledge transfer.
Feature augmentation enhances student MLP expressiveness.
Abstract
Recent works have introduced GNN-to-MLP knowledge distillation (KD) frameworks to combine both GNN's superior performance and MLP's fast inference speed. However, existing KD frameworks are primarily designed for node classification within single graphs, leaving their applicability to graph classification largely unexplored. Two main challenges arise when extending KD for node classification to graph classification: (1) The inherent sparsity of learning signals due to soft labels being generated at the graph level; (2) The limited expressiveness of student MLPs, especially in datasets with limited input feature spaces. To overcome these challenges, we introduce MuGSI, a novel KD framework that employs Multi-granularity Structural Information for graph classification. Specifically, we propose multi-granularity distillation loss in MuGSI to tackle the first challenge. This loss function…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsKnowledge Distillation
