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 ${\mathcal{S}}\left(x\right)$ around a biased sample x. The derived bounds are utilized to guide fairness repair which encourages the model to produce consistent outputs on ${\mathcal{S}}\left(x\right)$. 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 ${\mathcal{S}}\left(x\right)$. 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 in this $\color{red}{\text{repository}}$.

@inproceedings{paperbot9546,
  title = {Provable Fairness Repair for Deep Neural Networks},
  author = {Jianan Ma and Jingyi Wang and Qi Xuan and Zhen Wang},
  booktitle = {ASE},
  year = {2025},
  doi = {10.1109/ase63991.2025.00049}
}