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

数学判别中模型不确定性的解释

Accounting for Model Uncertainty in Algorithmic Discrimination

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

Junaid Ali, Preethi Lahoti, Krishna P. Gummadi

摘要:

在算法决策中确保群体公平性的传统方法旨在均衡群体中不同子群体的“总体”出错率。相比之下,我们认为,公平的方法,而不是只专注于均衡错误所产生的模型不确定性(又名认知的不确定性),造成由于缺乏知识的最佳模型或由于缺乏数据。换句话说,我们的建议要求忽略由于数据中固有的不确定性而发生的错误,即,任意的不确定性我们得出了预测的多重性和模型的不确定性之间的连接,并认为预测的多重性的技术可以用来识别由于模型的不确定性所造成的错误。我们提出了可扩展的凸代理来展示预测多样性的分类器,并根据经验表明,我们的方法在性能上具有可比性,并且比目前的状态快四个数量级。我们进一步提出了方法,以实现我们的目标,均衡组出错率,由于模型的不确定性,在算法决策,并证明这些方法的有效性,使用合成和真实的。世界数据集

英文摘要:

Traditional approaches to ensure group fairness in algorithmic decision making aim to equalize ``total'' error rates for different subgroups in the population. In contrast, we argue that the fairness approaches should instead focus only on equalizing errors arising due to model uncertainty (a.k.a epistemic uncertainty), caused due to lack of knowledge about the best model or due to lack of data. In other words, our proposal calls for ignoring the errors that occur due to uncertainty inherent in the data, i.e., aleatoric uncertainty. We draw a connection between predictive multiplicity and model uncertainty and argue that the techniques from predictive multiplicity could be used to identify errors made due to model uncertainty. We propose scalable convex proxies to come up with classifiers that exhibit predictive multiplicity and empirically show that our methods are comparable in performance and up to four orders of magnitude faster than the current state-of-the-art. We further propose methods to achieve our goal of equalizing group error rates arising due to model uncertainty in algorithmic decision making and demonstrate the effectiveness of these methods using synthetic and real-world datasets.

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

↑