一句话:提出黑盒个体公平性测试算法 Aft,用决策树近似模型采样路径生成歧视实例。
随着机器学习系统在高社会影响领域广泛应用,其公平性问题日益突出。个体公平性测试旨在寻找违反个体公平性的个体歧视实例(IDI),但现有黑盒方法在效率和实例多样性上仍有不足。本文提出 Aft(Approximation-guided Fairness Testing),一种通过歧视空间分析实现的黑盒测试算法。Aft 基于决策树构建待测分类器的近似模型,并沿决策树路径采样生成测试用例,以搜索潜在 IDI。实验表明,与当前最优黑盒个体公平性测试算法 ExpGA 相比,Aft 在效率上提升 3.42 倍,所识别 IDI 的多样性提升 1.16 倍。
As machine learning (ML) systems are increasingly used in various fields, including tasks with high social impact, concerns about their fairness are growing. To address these concerns, individual fairness testing (IFT) has been introduced to identify individual discriminatory instances (IDIs) that indicate the violation of individual fairness in a given ML classifier. In this paper, we propose a black-box testing algorithm for IFT, named Aft (short for Approximation-guided Fairness Testing). Aft constructs approximate models based on decision trees, and generates test cases by sampling paths of the decision trees. Our evaluation by experiments confirms that Aft outperforms the state-of-the-art black-box IFT algorithm ExpGA both in efficiency (by 3.42 times) and diversity of IDIs identified by algorithms (by 1.16 times).CCS CONCEPTS• Software and its engineering → Software testing and debugging.