Integrating Fairness and Model Pruning Through Bi-level Optimization
Not on the map. Why?
Abstract (arXiv)
Deep neural networks have achieved exceptional results across a range of applications. As the demand for efficient and sparse deep learning models escalates, the significance of model compression, particularly pruning, is increasingly recognized. Traditional pruning methods, however, can unintentionally intensify algorithmic biases, leading to unequal prediction outcomes in critical applications and raising concerns about the dilemma of pruning practices and social justice. To tackle this challenge, we introduce a novel concept of fair model pruning, which involves developing a sparse model that adheres to fairness criteria. In particular, we propose a framework to jointly optimize the pruning mask and weight update processes with fairness constraints. This framework is engineered to compress models that maintain performance while ensuring fairness in a unified process. To this end, we formulate the fair pruning problem as a novel constrained bi-level optimization task and derive efficient and effective solving strategies. We design experiments across various datasets and scenarios to validate our proposed method. Our empirical analysis contrasts our framework with several mainstream pruning strategies, emphasizing our method's superiority in maintaining model fairness, performance, and efficiency.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 36 of its 55 references that are in the map. First posted on arXiv 15 Dec 2023.
Builds on
36 of 55 references.
References · 36
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2014Image Super-Resolution Using Deep Convolutional Networkscited by 1,224
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2017Algorithmic decision making and the cost of fairnesscited by 403
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
- 2018Learning Adversarially Fair and Transferable Representationscited by 353
24 more
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
- 2019What's Hidden in a Randomly Weighted Neural Network?cited by 237
- 2016Dynamic Network Surgery for Efficient DNNscited by 233
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 227
- 2019What Do Compressed Deep Neural Networks Forget?cited by 171
- 2020Dynamic Model Pruning with Feedbackcited by 125
- 2018A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multiplierscited by 120
- 2018Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layerscited by 112
- 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
- 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
- 2017More is Less: A More Complicated Network with Less Inference Complexitycited by 66
- 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
- 2019Learning Filter Basis for Convolutional Neural Network Compressioncited by 57
- 2022Advancing Model Pruning via Bi-level Optimizationcited by 56
- 2019Equalized odds postprocessing under imperfect group informationcited by 48
- 2022Pruning has a disparate impact on model accuracycited by 44
- 2018Data-Dependent Coresets for Compressing Neural Networks with Applications to Generalization Boundscited by 43
- 2018ADMM-NN: An Algorithm-Hardware Co-Design Framework of DNNs Using Alternating Direction Method of Multiplierscited by 42
- 2022FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classificationcited by 30
- 2020Prune Responsiblycited by 20
- 2021FairCal: Fairness Calibration for Face Verificationcited by 17
- 2023Bias in Pruned Vision Models: In-Depth Analysis and Countermeasurescited by 11
- 2022MixFairFace: Towards Ultimate Fairness via MixFair Adapter in Face Recognitioncited by 8
Built on by
Citing papers per year: 2026: 1.
1 paper.