通过条件风险价值测试进行多组公平性评估

Lucas Monteiro Paes, Ananda Theertha Suresh, Alex Beutel, Flavio P. Calmon, Ahmad Beirami
{"title":"通过条件风险价值测试进行多组公平性评估","authors":"Lucas Monteiro Paes, Ananda Theertha Suresh, Alex Beutel, Flavio P. Calmon, Ahmad Beirami","doi":"arxiv-2312.03867","DOIUrl":null,"url":null,"abstract":"Machine learning (ML) models used in prediction and classification tasks may\ndisplay performance disparities across population groups determined by\nsensitive attributes (e.g., race, sex, age). We consider the problem of\nevaluating the performance of a fixed ML model across population groups defined\nby multiple sensitive attributes (e.g., race and sex and age). Here, the sample\ncomplexity for estimating the worst-case performance gap across groups (e.g.,\nthe largest difference in error rates) increases exponentially with the number\nof group-denoting sensitive attributes. To address this issue, we propose an\napproach to test for performance disparities based on Conditional Value-at-Risk\n(CVaR). By allowing a small probabilistic slack on the groups over which a\nmodel has approximately equal performance, we show that the sample complexity\nrequired for discovering performance violations is reduced exponentially to be\nat most upper bounded by the square root of the number of groups. As a\nbyproduct of our analysis, when the groups are weighted by a specific prior\ndistribution, we show that R\\'enyi entropy of order $2/3$ of the prior\ndistribution captures the sample complexity of the proposed CVaR test\nalgorithm. Finally, we also show that there exists a non-i.i.d. data collection\nstrategy that results in a sample complexity independent of the number of\ngroups.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"103 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-Group Fairness Evaluation via Conditional Value-at-Risk Testing\",\"authors\":\"Lucas Monteiro Paes, Ananda Theertha Suresh, Alex Beutel, Flavio P. Calmon, Ahmad Beirami\",\"doi\":\"arxiv-2312.03867\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Machine learning (ML) models used in prediction and classification tasks may\\ndisplay performance disparities across population groups determined by\\nsensitive attributes (e.g., race, sex, age). We consider the problem of\\nevaluating the performance of a fixed ML model across population groups defined\\nby multiple sensitive attributes (e.g., race and sex and age). Here, the sample\\ncomplexity for estimating the worst-case performance gap across groups (e.g.,\\nthe largest difference in error rates) increases exponentially with the number\\nof group-denoting sensitive attributes. To address this issue, we propose an\\napproach to test for performance disparities based on Conditional Value-at-Risk\\n(CVaR). By allowing a small probabilistic slack on the groups over which a\\nmodel has approximately equal performance, we show that the sample complexity\\nrequired for discovering performance violations is reduced exponentially to be\\nat most upper bounded by the square root of the number of groups. As a\\nbyproduct of our analysis, when the groups are weighted by a specific prior\\ndistribution, we show that R\\\\'enyi entropy of order $2/3$ of the prior\\ndistribution captures the sample complexity of the proposed CVaR test\\nalgorithm. Finally, we also show that there exists a non-i.i.d. data collection\\nstrategy that results in a sample complexity independent of the number of\\ngroups.\",\"PeriodicalId\":501433,\"journal\":{\"name\":\"arXiv - CS - Information Theory\",\"volume\":\"103 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2312.03867\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2312.03867","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在预测和分类任务中使用的机器学习(ML)模型可能会在由敏感属性(如种族、性别、年龄)决定的人群中显示出性能差异。我们考虑的问题是在由多个敏感属性(如种族、性别和年龄)定义的人群中评估固定 ML 模型的性能。在这种情况下,估计不同群体间最坏情况下的性能差距(例如误差率的最大差异)的样本复杂度会随着群体敏感属性的数量呈指数增长。为了解决这个问题,我们提出了一种基于条件风险值(CVaR)的性能差距测试方法。通过允许模型在性能大致相同的组别上有较小的概率松弛,我们证明发现性能违规所需的样本复杂度会以指数形式降低,最大上限值为组别数的平方根。作为我们分析的一个副产品,当各组由特定的优先级分布加权时,我们证明优先级分布的阶数为 2/3$ 的 R\'enyi entropy 捕获了所提出的 CVaR 测试算法的样本复杂度。最后,我们还证明,存在一种非 i.i.d. 数据收集策略,其样本复杂度与组数无关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multi-Group Fairness Evaluation via Conditional Value-at-Risk Testing
Machine learning (ML) models used in prediction and classification tasks may display performance disparities across population groups determined by sensitive attributes (e.g., race, sex, age). We consider the problem of evaluating the performance of a fixed ML model across population groups defined by multiple sensitive attributes (e.g., race and sex and age). Here, the sample complexity for estimating the worst-case performance gap across groups (e.g., the largest difference in error rates) increases exponentially with the number of group-denoting sensitive attributes. To address this issue, we propose an approach to test for performance disparities based on Conditional Value-at-Risk (CVaR). By allowing a small probabilistic slack on the groups over which a model has approximately equal performance, we show that the sample complexity required for discovering performance violations is reduced exponentially to be at most upper bounded by the square root of the number of groups. As a byproduct of our analysis, when the groups are weighted by a specific prior distribution, we show that R\'enyi entropy of order $2/3$ of the prior distribution captures the sample complexity of the proposed CVaR test algorithm. Finally, we also show that there exists a non-i.i.d. data collection strategy that results in a sample complexity independent of the number of groups.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Massive MIMO CSI Feedback using Channel Prediction: How to Avoid Machine Learning at UE? Reverse em-problem based on Bregman divergence and its application to classical and quantum information theory From "um" to "yeah": Producing, predicting, and regulating information flow in human conversation Electrochemical Communication in Bacterial Biofilms: A Study on Potassium Stimulation and Signal Transmission Semantics-Empowered Space-Air-Ground-Sea Integrated Network: New Paradigm, Frameworks, and Challenges
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1