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

公平约束:公平分类的机制

Fairness Constraints: Mechanisms for Fair Classification

Max Planck Institute for Software Systems(马克斯·普朗克软件系统研究所)

Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez Rodriguez, Krishna P. Gummadi

摘要:

商业决策系统在各种各样的在线和离线服务中无处不在。这些系统依赖于复杂的学习方法和大量的数据来优化服务功能、最终用户的满意度和盈利能力。然而,人们越来越担心,即使没有意图,这些自动化的决定也会导致缺乏公平性,即,它们的结果可能不成比例地伤害(或,受益)共享一个或多个敏感属性的特定人群(例如,种族、性别)。在本文中,我们引入了一个灵活的机制,设计公平的分类器,利用一种新的直观的衡量决策边界(非)公平。我们实例化这种机制与两个著名的分类,逻辑斯谛回归和支持向量机,并显示在现实世界的数据,我们的机制允许一个细粒度的控制的公平程度,往往在一个小的成本方面的准确性。

英文摘要:

Algorithmic decision making systems are ubiquitous across a wide variety of online as well as offline services. These systems rely on complex learning methods and vast amounts of data to optimize the service functionality, satisfaction of the end user and profitability. However, there is a growing concern that these automated decisions can lead, even in the absence of intent, to a lack of fairness, i.e., their outcomes can disproportionately hurt (or, benefit) particular groups of people sharing one or more sensitive attributes (e.g., race, sex). In this paper, we introduce a flexible mechanism to design fair classifiers by leveraging a novel intuitive measure of decision boundary (un)fairness. We instantiate this mechanism with two well-known classifiers, logistic regression and support vector machines, and show on real-world data that our mechanism allows for a fine-grained control on the degree of fairness, often at a small cost in terms of accuracy.

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

↑