Optimizing fairness tradeoffs in machine learning with multiobjective meta-models

William G La Cava
{"title":"Optimizing fairness tradeoffs in machine learning with multiobjective meta-models","authors":"William G La Cava","doi":"10.1145/3583131.3590487","DOIUrl":null,"url":null,"abstract":"Improving the fairness of machine learning models is a nuanced task that requires decision makers to reason about multiple, conflicting criteria. The majority of fair machine learning methods transform the error-fairness trade-off into a single objective problem with a parameter controlling the relative importance of error versus fairness. We propose instead to directly optimize the error-fairness tradeoff by using multi-objective optimization. We present a flexible framework for defining the fair machine learning task as a weighted classification problem with multiple cost functions. This framework is agnostic to the underlying prediction model as well as the metrics. We use multiobjective optimization to define the sample weights used in model training for a given machine learner, and adapt the weights to optimize multiple metrics of fairness and accuracy across a set of tasks. To reduce the number of optimized parameters, and to constrain their complexity with respect to population subgroups, we propose a novel meta-model approach that learns to map protected attributes to sample weights, rather than optimizing those weights directly. On a set of real-world problems, this approach outperforms current state-of-the-art methods by finding solution sets with preferable error/fairness trade-offs.","PeriodicalId":89841,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference. Genetic and Evolutionary Computation Conference","volume":"29 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Genetic and Evolutionary Computation Conference. Genetic and Evolutionary Computation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3583131.3590487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Improving the fairness of machine learning models is a nuanced task that requires decision makers to reason about multiple, conflicting criteria. The majority of fair machine learning methods transform the error-fairness trade-off into a single objective problem with a parameter controlling the relative importance of error versus fairness. We propose instead to directly optimize the error-fairness tradeoff by using multi-objective optimization. We present a flexible framework for defining the fair machine learning task as a weighted classification problem with multiple cost functions. This framework is agnostic to the underlying prediction model as well as the metrics. We use multiobjective optimization to define the sample weights used in model training for a given machine learner, and adapt the weights to optimize multiple metrics of fairness and accuracy across a set of tasks. To reduce the number of optimized parameters, and to constrain their complexity with respect to population subgroups, we propose a novel meta-model approach that learns to map protected attributes to sample weights, rather than optimizing those weights directly. On a set of real-world problems, this approach outperforms current state-of-the-art methods by finding solution sets with preferable error/fairness trade-offs.
基于多目标元模型的机器学习公平性优化
提高机器学习模型的公平性是一项微妙的任务,需要决策者对多个相互冲突的标准进行推理。大多数公平的机器学习方法将错误与公平的权衡转化为一个单一的客观问题,其中有一个参数控制错误与公平的相对重要性。我们建议使用多目标优化来直接优化误差与公平性的权衡。我们提出了一个灵活的框架,将公平机器学习任务定义为具有多个成本函数的加权分类问题。这个框架对于底层的预测模型和度量是不可知的。我们使用多目标优化来定义给定机器学习者模型训练中使用的样本权重,并调整权重来优化一组任务中的公平性和准确性的多个指标。为了减少优化参数的数量,并约束它们相对于总体子组的复杂性,我们提出了一种新的元模型方法,该方法学习将受保护属性映射到样本权重,而不是直接优化这些权重。在一组现实世界的问题上,这种方法通过找到具有更好的错误/公平权衡的解决方案集,胜过当前最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书