Provable Fairness Repair for Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
Deep neural networks (DNNs) are suffering from ethical issues such as individual discrimination. In response, extensive NN repair techniques have been developed to adjust models and mitigate such undesired behaviors. However, existing fairness repair methods are typically data-centric, which often lack provable guarantees and generalization to unseen samples. To overcome these limitations, we propose ProF, a novel fairness repair framework with provable guarantees. The key intuition of ProF is to leverage interval bound propagation (a widely used NN verification technique) to soundly capture model outputs over the whole set S(x) around a biased sample x. The derived bounds are utilized to guide fairness repair which encourages the model to produce consistent outputs on S(x). Specifically, we integrate fairness constraints and model modifications into a unified constraint-solving formulation, which can be transformed to a Mixed-Integer Linear Programming (MILP) problem solvable by off-the-shelf solvers. The solution to the MILP problem effectively induces a repaired model with guaranteed fairness over the whole set S(x). We evaluate ProF on four widely used benchmark datasets and demonstrate that it achieves provable fairness repair, with generalization of up to 95.93% on full datasets and 93.16% on the entire input space. Notably, ProF can be easily configured to support multiple sensitive attributes and more practical fairness definitions, while providing provable repair guarantees and delivering around 90% fairness improvement. Our code is available at https://github.com/nninjn/ProF.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 61 references that are in the map. First posted on arXiv 19 May 2026.
Builds on
27 of 61 references.
References · 27
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2021Convex optimizationcited by 2,479
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
- 2014Certifying and removing disparate impactcited by 715
- 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
- 2018Formal Security Analysis of Neural Networks using Symbolic Intervalscited by 185
- 2018Efficient Formal Safety Analysis of Neural Networkscited by 165
- 2019Branch and Bound for Piecewise Linear Neural Network Verificationcited by 138
- 2022Fairness Testing: A Comprehensive Survey and Analysis of Trendscited by 61
- 2020Verifying Individual Fairness in Machine Learning Modelscited by 49
- 2020Empirical observation of negligible fairness-accuracy trade-offs in machine learning for public policycited by 44
15 more
- 2022Causality-based Neural Network Repaircited by 44
- 2021NeuronFair: Interpretable White-Box Fairness Testing through Biased Neuron Identificationcited by 42
- 2021Provable Repair of Deep Neural Networkscited by 39
- 2020Improving Neural Network Verification through Spurious Region Guided Refinementcited by 30
- 2021Deep Learning-Based Autonomous Driving Systems: A Survey of Attacks and Defensescited by 29
- 2019Arachne: Search Based Repair of Deep Neural Networkscited by 25
- 2022Fairify: Fairness Verification of Neural Networkscited by 22
- 2021Probabilistic Verification of Neural Networks Against Group Fairnesscited by 17
- 2021Sound and Complete Neural Network Repair with Minimality and Locality Guaranteescited by 12
- 2023FAIRER: Fairness as Decision Rationale Alignmentcited by 12
- 2023Architecture-Preserving Provable Repair of Deep Neural Networkscited by 9
- 2024NeuFair: Neural Network Fairness Repair with Dropoutcited by 9
- 2024FairQuant: Certifying and Quantifying Fairness of Deep Neural Networkscited by 4
- 2024MAFT: Efficient Model-Agnostic Fairness Testing for Deep Neural Networks via Zero-Order Gradient Searchcited by 4
- 2025Fairness Testing through Extreme Value Theorycited by 2
Built on by
Not cited yet.