Prune and Distill: A Novel Knowledge Distillation Method for GCNs-Based Recommender Systems

Graph convolutional networks (GCNs)-based recommenders have demonstrated remarkable recommendation performances but suffer from prohibitive computational cost, limiting their practical deployment. Knowledge distillation provides an effective approach to address this challenge by training a compact student model to inherit knowledge from a complex teacher, balancing accuracy and efficiency. However, existing knowledge distillation methods primarily focus on optimizing loss functions while neglecting the critical role of the graph structure for the student model in capturing personalized preferences. In this paper, we propose Prune and Distill (PAD), a novel knowledge distillation framework that refines the graph structure of the student by pruning redundant connections and enriching informative adjacencies under the guidance of the teacher model. By directly enhancing the structural representation of the student model, PAD facilitates effective preference while preserving competitive recommendation performance. Extensive experiments on three benchmark datasets demonstrate that PAD-enhanced student recommender outperforms state-of-the-art recommendation models with significantly reduced computational overhead, validating PAD’s superiority in effectiveness and efficiency for real-world applications.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3573181
Citations
1
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
3.25

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prune and Distill: A Novel Knowledge Distillation Method for GCNs-Based Recommender Systems

Cheng Yang, Xiongcai Cai, Lu Chen, Peng Yi et al.
1 citations
IEEE Access
Recommender Systems and Techniques
3.25
article

Prune and Distill: A Novel Knowledge Distillation Method for GCNs-Based Recommender Systems

Cheng Yang, Xiongcai Cai, Lu Chen, Peng Yi, Zhaoxian Li
article en
1 citations

Abstract

Graph convolutional networks (GCNs)-based recommenders have demonstrated remarkable recommendation performances but suffer from prohibitive computational cost, limiting their practical deployment. Knowledge distillation provides an effective approach to address this challenge by training a compact student model to inherit knowledge from a complex teacher, balancing accuracy and efficiency. However, existing knowledge distillation methods primarily focus on optimizing loss functions while neglecting the critical role of the graph structure for the student model in capturing personalized preferences. In this paper, we propose Prune and Distill (PAD), a novel knowledge distillation framework that refines the graph structure of the student by pruning redundant connections and enriching informative adjacencies under the guidance of the teacher model. By directly enhancing the structural representation of the student model, PAD facilitates effective preference while preserving competitive recommendation performance. Extensive experiments on three benchmark datasets demonstrate that PAD-enhanced student recommender outperforms state-of-the-art recommendation models with significantly reduced computational overhead, validating PAD’s superiority in effectiveness and efficiency for real-world applications.

IEEE AccessVol. 13
University of Copenhagen (DK), UNSW Sydney (AU), Communication University of China (CN)
Communication University of China
Zero hunger
Openalex Percentile: Top 9%
Recommender Systems and Techniques
3.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.