mlsanityData to 7 Oct 2026

Unbiased Knowledge Distillation for Recommendation

arXiv 2211.14729 ↗First posted 27 Nov 2022cs.IR cs.AIcited by 11

Not on the map. Why?

Abstract (arXiv)

As a promising solution for model compression, knowledge distillation (KD) has been applied in recommender systems (RS) to reduce inference latency. Traditional solutions first train a full teacher model from the training data, and then transfer its knowledge (ie textitsoft labels) to supervise the learning of a compact student model. However, we find such a standard distillation paradigm would incur serious bias issue -- popular items are more heavily recommended after the distillation. This effect prevents the student model from making accurate and fair recommendations, decreasing the effectiveness of RS. In this work, we identify the origin of the bias in KD -- it roots in the biased soft labels from the teacher, and is further propagated and intensified during the distillation. To rectify this, we propose a new KD method with a stratified distillation strategy. It first partitions items into multiple groups according to their popularity, and then extracts the ranking knowledge within each group to supervise the learning of the student. Our method is simple and teacher-agnostic -- it works on distillation stage without affecting the training of the teacher model. We conduct extensive theoretical and empirical studies to validate the effectiveness of our proposal. We release our code at: https://github.com/chengang95/UnKD.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 25 of its 47 references that are in the map. First posted on arXiv 27 Nov 2022.

Builds on

25 of 47 references.

References · 25

  1. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  2. 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 298
  3. 2019Structured Knowledge Distillation for Dense Predictioncited by 277
  4. 2020Counterfactual VQA: A Cause-Effect Look at Language Biascited by 266
  5. 2020Long-Tailed Classification by Keeping the Good and Removing the Bad Momentum Causal Effectcited by 256
  6. 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
  7. 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
  8. 2021Distilling Causal Effect of Data in Class-Incremental Learningcited by 117
  9. 2021Causal Intervention for Leveraging Popularity Bias in Recommendationcited by 116
  10. 2020Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender Systemcited by 94
  11. 2017Causal Embeddings for Recommendationcited by 79
  12. 2021AutoDebias: Learning to Debias for Recommendationcited by 68
13 more
  1. 2018Ranking Distillation: Learning Compact Ranking Models With High Performance for Recommender Systemcited by 60
  2. 2020DE-RRD: A Knowledge Distillation Framework for Recommender Systemcited by 28
  3. 2020Should Graph Convolution Trust Neighbors? A Simple Causal Inference Methodcited by 25
  4. 2021Topology Distillation for Recommender Systemcited by 24
  5. 2022Cross-Task Knowledge Distillation in Multi-Task Recommendationcited by 22
  6. 2021Bidirectional Distillation for Top-K Recommender Systemcited by 21
  7. 2021Top-N Recommendation with Counterfactual User Preference Simulationcited by 21
  8. 2022On-Device Next-Item Recommendation with Self-Supervised Knowledge Distillationcited by 21
  9. 2020Ensemble Knowledge Distillation for CTR Predictioncited by 18
  10. 2022UKD: Debiasing Conversion Rate Estimation via Uncertainty-regularized Knowledge Distillationcited by 14
  11. 2019Collaborative Distillation for Top-N Recommendationcited by 13
  12. 2019Crank up the volume: preference bias amplification in collaborative recommendationcited by 12
  13. 2019Distilling Structured Knowledge into Embeddings for Explainable and Accurate Recommendationcited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 3; 2025: 4; 2026: 3.

11 papers.