arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1812.02573cs.AI
收藏

公平性的集中概率检验

Probabilistic Verification of Fairness Properties via Concentration

University of Pennsylvania(宾夕法尼亚大学);MIT(麻省理工学院)

Osbert Bastani, Xin Zhang, Armando Solar-Lezama

摘要:

随着机器学习系统越来越多地用于做出现实世界的法律和财务决策,我们开发算法来验证这些系统不歧视少数群体至关重要。我们设计了一个可扩展的算法来验证公平性规范。我们的算法获得了强大的正确性保证的基础上自适应浓度不等式,这样的不等式使我们的算法自适应地采取样本,直到它有足够的数据来做出决定。我们在一个名为VeriFair的工具中实现了我们的算法,并证明了它可以扩展到大型机器学习模型,包括一个深度递归神经网络,它比之前验证的最大神经网络大五个数量级以上。虽然我们的技术只提供概率保证,由于使用随机样本,我们表明,我们可以选择的错误概率是非常小的。

英文摘要:

As machine learning systems are increasingly used to make real world legal and financial decisions, it is of paramount importance that we develop algorithms to verify that these systems do not discriminate against minorities. We design a scalable algorithm for verifying fairness specifications. Our algorithm obtains strong correctness guarantees based on adaptive concentration inequalities; such inequalities enable our algorithm to adaptively take samples until it has enough data to make a decision. We implement our algorithm in a tool called VeriFair, and show that it scales to large machine learning models, including a deep recurrent neural network that is more than five orders of magnitude larger than the largest previously-verified neural network. While our technique only gives probabilistic guarantees due to the use of random samples, we show that we can choose the probability of error to be extremely small.

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

↑