mlsanityData to 7 Oct 2026

RELIANT: Fair Knowledge Distillation for Graph Neural Networks

arXiv 2301.01150 ↗First posted 3 Jan 2023cs.LG cs.CYcited by 10

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) have shown satisfying performance on various graph learning tasks. To achieve better fitting capability, most GNNs are with a large number of parameters, which makes these GNNs computationally expensive. Therefore, it is difficult to deploy them onto edge devices with scarce computational resources, e.g., mobile phones and wearable smart devices. Knowledge Distillation (KD) is a common solution to compress GNNs, where a light-weighted model (i.e., the student model) is encouraged to mimic the behavior of a computationally expensive GNN (i.e., the teacher GNN model). Nevertheless, most existing GNN-based KD methods lack fairness consideration. As a consequence, the student model usually inherits and even exaggerates the bias from the teacher GNN. To handle such a problem, we take initial steps towards fair knowledge distillation for GNNs. Specifically, we first formulate a novel problem of fair knowledge distillation for GNN-based teacher-student frameworks. Then we propose a principled framework named RELIANT to mitigate the bias exhibited by the student model. Notably, the design of RELIANT is decoupled from any specific teacher and student model structures, and thus can be easily adapted to various GNN-based KD frameworks. We perform extensive experiments on multiple real-world datasets, which corroborates that RELIANT achieves less biased GNN knowledge distillation while maintaining high prediction utility.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 21 of its 36 references that are in the map. First posted on arXiv 3 Jan 2023.

Builds on

21 of 36 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2017Inductive Representation Learning on Large Graphscited by 6,284
  5. 2016Equality of Opportunity in Supervised Learningcited by 2,000
  6. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
  7. 2020Knowledge Distillation: A Surveycited by 1,578
  8. 2019Simplifying Graph Convolutional Networkscited by 1,470
  9. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  10. 2020Simple and Deep Graph Convolutional Networkscited by 857
  11. 2020Say No to the Discrimination: Learning Fair Graph Neural Networks with Limited Sensitive Attribute Informationcited by 168
  12. 2021Towards a Unified Framework for Fair and Stable Graph Representation Learningcited by 128
9 more
  1. 2021EDITS: Modeling and Mitigating Data Bias for Graph Neural Networkscited by 92
  2. 2022Fairness in Graph Mining: A Surveycited by 76
  3. 2021Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Frameworkcited by 69
  4. 2022Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute Leakagecited by 61
  5. 2021On Representation Knowledge Distillation for Graph Neural Networkscited by 38
  6. 2022Compressing Deep Graph Neural Networks via Adversarial Knowledge Distillationcited by 18
  7. 2022Interpreting Unfairness in Graph Neural Networks via Training Node Attributioncited by 18
  8. 2022On Structural Explanation of Bias in Graph Neural Networkscited by 15
  9. 2019TextKD-GAN: Text Generation using KnowledgeDistillation and Generative Adversarial Networkscited by 14

Built on by

Cited by year

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

10 papers.