Balancing Act: Constraining Disparate Impact in Sparse Models
Not on the map. Why?
Abstract (arXiv)
Model pruning is a popular approach to enable the deployment of large deep learning models on edge devices with restricted computational or storage capacities. Although sparse models achieve performance comparable to that of their dense counterparts at the level of the entire dataset, they exhibit high accuracy drops for some data sub-groups. Existing methods to mitigate this disparate impact induced by pruning (i) rely on surrogate metrics that address the problem indirectly and have limited interpretability; or (ii) scale poorly with the number of protected sub-groups in terms of computational cost. We propose a constrained optimization approach that directly addresses the disparate impact of pruning: our formulation bounds the accuracy change between the dense and sparse models, for each sub-group. This choice of constraints provides an interpretable success criterion to determine if a pruned model achieves acceptable disparity levels. Experimental results demonstrate that our technique scales reliably to problems involving large models and hundreds of protected sub-groups.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 41 of its 60 references that are in the map. First posted on arXiv 31 Oct 2023.
Builds on
41 of 60 references.
References · 41
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2022Hierarchical Text-Conditional Image Generation with CLIP Latentscited by 6,585
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2022Generative Adversarial Networkscited by 5,627
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2019A Survey on Bias and Fairness in Machine Learningcited by 1,917
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 815
29 more
- 2018A Reductions Approach to Fair Classificationcited by 587
- 2020What is the State of Neural Network Pruning?cited by 583
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2017Age Progression/Regression by Conditional Adversarial Autoencodercited by 429
- 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 402
- 2020Responsive Safety in Reinforcement Learning by PID Lagrangian Methodscited by 316
- 2017Fairness in Criminal Justice Risk Assessments: The State of the Artcited by 315
- 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 270
- 2019What Do Compressed Deep Neural Networks Forget?cited by 171
- 2018A Variational Inequality Perspective on Generative Adversarial Networkscited by 144
- 2019Inherent Tradeoffs in Learning Fair Representationscited by 144
- 2018Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goalscited by 103
- 2019On Empirical Comparisons of Optimizers for Deep Learningcited by 103
- 2019FairFace: Face Attribute Dataset for Balanced Race, Gender, and Agecited by 87
- 2020Variance-Reduced Methods for Machine Learningcited by 79
- 2019Reducing Noise in GAN Training with Variance Reduced Extragradientcited by 62
- 2017From Parity to Preference-based Notions of Fairness in Classificationcited by 60
- 2020Probably Approximately Correct Constrained Learningcited by 47
- 2022Pruning has a disparate impact on model accuracycited by 44
- 2021Constrained Learning with Non-Convex Lossescited by 42
- 2022Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methodscited by 37
- 2022On Learning Fairness and Accuracy on Multiple Subgroupscited by 32
- 2021Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimizationcited by 31
- 2022FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classificationcited by 30
- 2021A Stochastic Optimization Framework for Fair Risk Minimizationcited by 26
- 2022Controlled Sparsity via Constrained Optimization or: How I Learned to Stop Tuning Penalties and Love Constraintscited by 25
- 2022A Lagrangian Duality Approach to Active Learningcited by 24
- 2022Automatic Data Augmentation via Invariance-Constrained Learningcited by 17
Built on by
Citing papers per year: 2024: 4; 2025: 3.
7 papers.
- 2024On PI Controllers for Updating Lagrange Multipliers in Constrained Optimizationcited by 12
- 2025Cooper: A Library for Constrained Optimization in Deep Learningcited by 11
- 2024LayerMerge: Neural Network Depth Compression through Layer Pruning and Mergingcited by 7
- 2025Position: Adopt Constraints Over Fixed Penalties in Deep Learningcited by 5
- 2024Position: Cracking the Code of Cascading Disparity Towards Marginalized Communitiescited by 4
- 2024FairLoRA: Unpacking Bias Mitigation in Vision Models with Fairness-Driven Low-Rank Adaptationcited by 3
- 2025Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in Disguisecited by 1
- 2025Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in Disguise26 Sep 2025
- 2025Position: Adopt Constraints Over Fixed Penalties in Deep Learning27 May 2025
- 2025Cooper: A Library for Constrained Optimization in Deep Learning1 Apr 2025
- 2024FairLoRA: Unpacking Bias Mitigation in Vision Models with Fairness-Driven Low-Rank Adaptation22 Oct 2024
- 2024LayerMerge: Neural Network Depth Compression through Layer Pruning and Merging18 Jun 2024
- 2024On PI Controllers for Updating Lagrange Multipliers in Constrained Optimization7 Jun 2024
- 2024Position: Cracking the Code of Cascading Disparity Towards Marginalized Communities3 Jun 2024