跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2312.10181 · v3

Integrating Fairness and Model Pruning Through Bi-level Optimization

首次提交 2023-12-16 04:08
版本更新 2026-11-15 03:02
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

Deep neural networks achieve high predictive performance but often require substantial computational and storage resources, which motivates model compression techniques such as neural network pruning. Conventional pruning methods, however, can introduce or amplify algorithmic bias and produce disparate outcomes across demographic groups. We study fair model pruning, which seeks sparse models that satisfy fairness criteria while maintaining predictive performance. We characterize fairness using both group accuracy disparity and differences in compression-induced accuracy degradation across demographic groups. We propose a framework that jointly optimizes pruning masks and model weights under fairness constraints, thereby integrating accuracy and fairness into the compression process. We formulate fair pruning as a constrained bi-level optimization problem and derive an efficient optimization procedure. Experiments across multiple datasets, predictive tasks, model architectures, and sparsity levels show that our framework improves the trade-off among fairness, accuracy, and training efficiency relative to the baseline pruning strategies. Compared with the strongest evaluated baselines, BiFP maintains competitive accuracy and fairness while requiring more than 94% fewer training iterations in the real-world experiments.

作者备注:Accepted by IEEE Big Data 2026

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-15 03:02 · 最新观测版本

Integrating Fairness and Model Pruning Through Bi-level Optimization

Deep neural networks achieve high predictive performance but often require substantial computational and storage resources, which motivates model compression techniques such as neural network pruning. Conventional pruning methods, however, can introduce or amplify algorithmic bias and produce disparate outcomes across demographic groups. We study fair model pruning, which seeks sparse models that satisfy fairness criteria while maintaining predictive performance. We characterize fairness using both group accuracy disparity and differences in compression-induced accuracy degradation across demographic groups. We propose a framework that jointly optimizes pruning masks and model weights under fairness constraints, thereby integrating accuracy and fairness into the compression process. We formulate fair pruning as a constrained bi-level optimization problem and derive an efficient optimization procedure. Experiments across multiple datasets, predictive tasks, model architectures, and sparsity levels show that our framework improves the trade-off among fairness, accuracy, and training efficiency relative to the baseline pruning strategies. Compared with the strongest evaluated baselines, BiFP maintains competitive accuracy and fairness while requiring more than 94% fewer training iterations in the real-world experiments.

查看此版本解读 →查看此版本原文 ↗