Balancing Act: Constraining Disparate Impact in Sparse Models
Meraj Hashemizadeh, Juan Ramirez, Rohan Sukumaran, Golnoosh Farnadi, Simon Lacoste-Julien, Jose Gallego-Posada
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6c75f1d0-e9a7-4ad5-b0d9-18df84b83fe8Cited by top-tier papers3
- On PI Controllers for Updating Lagrange Multipliers in Constrained OptimizationMotahareh Sohrabi, Juan Ramirez, Tianyue H. Zhang, Simon Lacoste-Julien et al.ICML 2024 · 7 citations
- LayerMerge: Neural Network Depth Compression through Layer Pruning and MergingJinuk Kim, Marwa El Halabi, Mingi Ji, Hyun Oh SongICML 2024 · 5 citations
- Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in DisguiseJuan Ramirez, Simon Lacoste-JulienICLR 2026 · 5 citations
Builds on9
- Rigging the Lottery: Making All Tickets WinnersUtku Evci, Trevor Gale, Jacob Menick, Pablo Samuel Castro et al.ICML 2020 · 723 citations
- On Gradient Descent Ascent for Nonconvex-Concave Minimax ProblemsTianyi Lin, Chi Jin, Michael I. JordanICML 2020 · 587 citations
- Responsive Safety in Reinforcement Learning by PID Lagrangian MethodsAdam Stooke, Joshua Achiam, Pieter AbbeelICML 2020 · 403 citations
- Probably Approximately Correct Constrained LearningLuiz F. O. Chamon, Alejandro RibeiroNeurIPS 2020 · 67 citations
- Pruning has a disparate impact on model accuracyCuong Tran, Ferdinando Fioretto, Jung-Eun Kim, Rakshit NaiduNeurIPS 2022 · 64 citations
Related papers
- Towards Fairness-aware Adversarial Network PruningLei Zhang, Zhibo Wang, Xiaowei Dong, Yunhe Feng et al.ICCV 2023 · 8 citations
- MyML: User-Driven Machine LearningVidushi Goyal, Valeria Bertacco, Reetuparna DasDAC 2021 · 3 citations
- Dataset Pruning: Reducing Training Data by Examining Generalization InfluenceShuo Yang, Zeke Xie, Hanyu Peng, Min Xu et al.ICLR 2023 · 21 citations
- Device-Wise Federated Network PruningShangqian Gao, Junyi Li, Zeyu Zhang, Yanfu Zhang et al.CVPR 2024
- DRoP: Distributionally Robust Data PruningArtem M. Vysogorets, Kartik Ahuja, Julia KempeICLR 2025
