ProGMLP: A Progressive Framework for GNN-to-MLP Knowledge Distillation with Efficient Trade-offs
Weigang Lu, Ziyu Guan, Wei Zhao, Yaming Yang, Yujie Sun, Zheng Liang, Yibing Zhan, Dapeng Tao
Abstract
GNN-to-MLP (G2M) methods have emerged as a promising approach to accelerate Graph Neural Networks (GNNs) by distilling their knowledge into simpler Multi-Layer Perceptrons (MLPs). These methods bridge the gap between the expressive power of GNNs and the computational efficiency of MLPs, making them well-suited for resource-constrained environments. However, existing G2M methods are limited by their inability to flexibly adjust inference cost and accuracy dynamically, a critical requirement for real-world applications where computational resources and time constraints can vary significantly. To address this, we introduce a Progressive framework designed to offer flexible and on-demand trade-offs between inference cost and accuracy for GNN-to-MLP knowledge distillation (ProGMLP). ProGMLP employs a Progressive Training Structure (PTS), where multiple MLP students are trained in sequence, each building on the previous one. Furthermore, ProGMLP incorporates Progressive Knowledge Distillation (PKD) to iteratively refine the distillation process from GNNs to MLPs, and Progressive Mixup Augmentation (PMA) to enhance generalization by progressively generating harder mixed samples. Our approach is validated through comprehensive experiments on eight real-world graph datasets, demonstrating that ProGMLP maintains high accuracy while dynamically adapting to varying runtime scenarios, making it highly effective for deployment in diverse application settings.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c920fd7f-0cf4-4ced-9238-a2a8ec6c096bBuilds on17
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Simple and Deep Graph Convolutional NetworksMing Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding et al.ICML 2020 · 1,910 citations
- Be Your Own Teacher: Improve the Performance of Convolutional Neural Networks via Self DistillationLinfeng Zhang, Jiebo Song, Anni Gao, Jingwei Chen et al.ICCV 2019 · 1,069 citations
- Graph-less Neural Networks: Teaching Old MLPs New Tricks Via DistillationShichang Zhang, Yozen Liu, Yizhou Sun, Neil ShahICLR 2022 · 234 citations
- TinyGNN: Learning Efficient Graph Neural NetworksBencheng Yan, Chaokun Wang, Gaoyang Guo, Yunkai LouKDD 2020 · 75 citations
Related papers
- AdaGMLP: AdaBoosting GNN-to-MLP Knowledge DistillationWeigang Lu, Ziyu Guan, Wei Zhao, Yaming YangKDD 2024 · 10 citations
- Extracting Low-/High- Frequency Knowledge from Graph Neural Networks and Injecting It into MLPs: An Effective GNN-to-MLP Distillation FrameworkLirong Wu, Haitao Lin, Yufei Huang, Tianyu Fan et al.AAAI 2023 · 52 citations
- TAG2M- A Task-Agnostic Knowledge Distillation Framework for Distilling GNN to MLPRam Ganesh V, Ayush Singh, Aditi Rai, Harsh Pal et al.KDD 2025
- VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPsLing Yang, Ye Tian, Minkai Xu, Zhongyi Liu et al.ICLR 2024 · 48 citations
- NodeBits: A Plug-and-Play Framework for Accelerating Graph Inference by Post-Hoc Binary QuantizationQihao Cheng, Tianhao Wu, Da Yan, Haoran TangKDD 2026
