Towards Fairness-aware Adversarial Network Pruning

Lei Zhang, Zhibo Wang, Xiaowei Dong, Yunhe Feng, Xiaoyi Pang, Zhifei Zhang, Kui Ren

Abstract

Deep learning models are often pruned to reduce size for edge deployment, but this process can inadvertently amplify hidden biases. We present a novel end-to-end framework for fairness-aware adversarial network pruning. By framing pruning as an adversarial game between a generator and a discriminator, our method identifies and removes biased and redundant neurons simultaneously. Experimental results on facial attribute datasets demonstrate that our approach significantly improves fairness metrics—by up to 50%—while maintaining high classification accuracy, even at high compression ratios.

Introduction

As deep learning models scale, pruning becomes necessary for deployment on resource-constrained devices like smartphones. However, recent studies indicate that standard pruning techniques can worsen biases inherited from training data. Current "debiasing" strategies typically occur before or after pruning, leading to a suboptimal trade-off between accuracy, model size, and fairness. We address this by proposing a joint optimization framework that treats fairness as a core objective during the pruning process.

Proposed Framework

Our method, Fairness-aware Adversarial Network Pruning, utilizes a two-player adversarial game to achieve balanced outcomes. The system consists of two primary components:

  1. The Generator ($G$): This is the neural network being pruned. It learns a binary mask to prune connections while maintaining high classification accuracy and minimizing bias.
  2. The Discriminator ($D$): This component attempts to predict sensitive attributes (e.g., gender) based solely on the Generator's output.

By training these components against each other, the Generator learns to eliminate connections that contribute to biased predictions. We specifically optimize for two major fairness metrics: Disparate Impact (DI), which ensures similar positive outcome rates across groups, and Equalized Odds (DEO), which ensures similar error rates.

The proposed fairness-aware adversarial network pruning framework.

Experimental Results

We evaluated our framework on the CelebA and LFW datasets, focusing on gender as a sensitive attribute. Our method consistently outperformed state-of-the-art pruning techniques like SGDP.

Key findings include:

  • Significant Fairness Gains: Our method improved fairness by approximately 50% compared to standard pruning methods while maintaining comparable accuracy.
  • The 80% Sweet Spot: On the CelebA dataset, we successfully pruned 80% of parameters while actually improving fairness metrics compared to the original, unpruned "dense" model.
  • Superiority over Training from Scratch: The adversarial approach achieved a DEO of 0.2149, significantly better than the 0.5071 achieved by training a sparse network from scratch at the same compression level.
Comparison of accuracy and fairness (DEO) across different pruning methods.

Key Insights

  • The Fairness Lottery Ticket: We discovered that "fair sub-networks" exist even within randomly initialized, untrained networks. This extends the "Lottery Ticket Hypothesis" to the realm of ethics, suggesting that ethical sub-structures are inherent in large models.
  • Joint Optimization: Unlike sequential methods, the adversarial approach allows the pruning mask to specifically target "biased neurons" and "redundant neurons" simultaneously.
  • Flexibility: The framework is end-to-end and learnable, making it adaptable to various network architectures like ResNet, ShuffleNet, and MobileNet.

Conclusion

This work demonstrates that fairness and model compression are not mutually exclusive. By integrating fairness into the pruning process via adversarial learning, we can produce efficient AI models that are both accurate and ethically robust. Future work will explore scaling this approach to intersectional fairness and continuous sensitive attributes.

Summary updated

Abstract

Network pruning aims to compress models while minimizing loss in accuracy. With the increasing focus on bias in AI systems, the bias inheriting or even magnification nature of traditional network pruning methods has raised a new perspective towards fairness-aware network pruning. Straightforward pruning plus debias methods and recent designs for monitoring disparities of demographic attributes during pruning have endeavored to enhance fairness in pruning. However, neither simple assembling of two tasks nor specifically designed pruning strategies could achieve the optimal trade-off among pruning ratio, accuracy, and fairness. This paper proposes an end-to-end learnable framework for fairness-aware network pruning, which optimizes both pruning and debias tasks jointly by adversarial training against those final evaluation metrics like accuracy for pruning, and disparate impact (DI) and equalized odds (DEO) for fairness. In other words, our fairness-aware adversarial pruning method would learn to prune without any handcraft rules. Therefore, our approach could flexibly adapt to variate network structures. Exhaustive experimentation demonstrates the generalization capacity of our approach, as well as superior performance on pruning and debias simultaneously. To highlight, the proposed method could preserve the SOTA pruning performance while significantly improving fairness by around 50% as compared to traditional pruning methods.
BibTeX
@inproceedings{zhang2023towards,
  author = {Lei Zhang and Zhibo Wang and Xiaowei Dong and Yunhe Feng and Xiaoyi Pang and Zhifei Zhang and Kui Ren},
  title = {{Towards Fairness-aware Adversarial Network Pruning}},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year = {2023},
  doi = {10.1109/iccv51070.2023.00477},
}
Figure