arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.11001cs.LG
收藏

Fairness-guided SMT-based Rectification of Decision Trees and Random Forests

National University of Singapore(新加坡国立大学);University of British Columbia(不列颠哥伦比亚大学);University College London(伦敦大学学院)

Jiang Zhang, Ivan Beschastnikh, Sergey Mechtaev, Abhik Roychoudhury

英文摘要:

Data-driven decision making is gaining prominence with the popularity of various machine learning models. Unfortunately, real-life data used in machine learning training may capture human biases, and as a result the learned models may lead to unfair decision making. In this paper, we provide a solution to this problem for decision trees and random forests. Our approach converts any decision tree or random forest into a fair one with respect to a specific data set, fairness criteria, and sensitive attributes. The \emph{FairRepair} tool, built based on our approach, is inspired by automated program repair techniques for traditional programs. It uses an SMT solver to decide which paths in the decision tree could have their outcomes flipped to improve the fairness of the model. Our experiments on the well-known adult dataset from UC Irvine demonstrate that FairRepair scales to realistic decision trees and random forests. Furthermore, FairRepair provides formal guarantees about soundness and completeness of finding a repair. Since our fairness-guided repair technique repairs decision trees and random forests obtained from a given (unfair) data-set, it can help to identify and rectify biases in decision-making in an organisation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑