Compressing deep graph convolution network with multi-staged knowledge distillation

23Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a trained deep graph convolution network (GCN), how can we effectively compress it into a compact network without significant loss of accuracy? Compressing a trained deep GCN into a compact GCN is of great importance for implementing the model to environments such as mobile or embedded systems, which have limited computing resources. However, previous works for compressing deep GCNs do not consider the multi-hop aggregation of the deep GCNs, though it is the main purpose for their multiple GCN layers. In this work, we propose MUSTAD (Multi-staged knowledge Distillation), a novel approach for compressing deep GCNs to single-layered GCNs through multi-staged knowledge distillation (KD). MUSTAD distills the knowledge of 1) the aggregation from multiple GCN layers as well as 2) task prediction while preserving the multi-hop feature aggregation of deep GCNs by a single effective layer. Extensive experiments on four real-world datasets show that MUSTAD provides the state-of-the-art performance compared to other KD based methods. Specifically, MUSTAD presents up to 4.21%p improvement of accuracy compared to the second-best KD models.

Cite

CITATION STYLE

APA

Kim, J., Jung, J., & Kang, U. (2021). Compressing deep graph convolution network with multi-staged knowledge distillation. PLoS ONE, 16(8 August). https://doi.org/10.1371/journal.pone.0256187

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free