公平意识多目标进化学习

IF 15.9 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE Transactions on Evolutionary Computation Pub Date : 2025-12-01 Epub Date: 2024-07-18 DOI:10.1109/TEVC.2024.3430824
Qingquan Zhang;Jialin Liu;Xin Yao
{"title":"公平意识多目标进化学习","authors":"Qingquan Zhang;Jialin Liu;Xin Yao","doi":"10.1109/TEVC.2024.3430824","DOIUrl":null,"url":null,"abstract":"Multiobjective evolutionary learning (MOEL) has demonstrated its advantages of training fairer machine learning models considering a predefined set of conflicting objectives, including accuracy and different fairness measures. Recent works propose to construct a representative subset of fairness measures as optimization objectives of MOEL throughout model training. However, the determination of a representative measure set relies on the dataset, prior knowledge, and requires substantial computational costs. What is more, those representative measures may differ across different model training processes. Instead of using a static predefined set determined before model training, this article proposes to dynamically and adaptively determine a representative measure set online during the model training. The dynamically determined representative set is then used as optimizing objectives of the MOEL framework and can vary with time. Extensive experimental results on 12 well-known benchmark datasets demonstrate that our proposed framework achieves outstanding performance compared to the state-of-the-art approaches for mitigating unfairness in terms of accuracy as well as 25 fairness measures although only a few of them were dynamically selected and used as optimization objectives. The results indicate the importance of setting optimization objectives dynamically during training.","PeriodicalId":13206,"journal":{"name":"IEEE Transactions on Evolutionary Computation","volume":"29 6","pages":"2372-2385"},"PeriodicalIF":15.9000,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fairness-Aware Multiobjective Evolutionary Learning\",\"authors\":\"Qingquan Zhang;Jialin Liu;Xin Yao\",\"doi\":\"10.1109/TEVC.2024.3430824\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiobjective evolutionary learning (MOEL) has demonstrated its advantages of training fairer machine learning models considering a predefined set of conflicting objectives, including accuracy and different fairness measures. Recent works propose to construct a representative subset of fairness measures as optimization objectives of MOEL throughout model training. However, the determination of a representative measure set relies on the dataset, prior knowledge, and requires substantial computational costs. What is more, those representative measures may differ across different model training processes. Instead of using a static predefined set determined before model training, this article proposes to dynamically and adaptively determine a representative measure set online during the model training. The dynamically determined representative set is then used as optimizing objectives of the MOEL framework and can vary with time. Extensive experimental results on 12 well-known benchmark datasets demonstrate that our proposed framework achieves outstanding performance compared to the state-of-the-art approaches for mitigating unfairness in terms of accuracy as well as 25 fairness measures although only a few of them were dynamically selected and used as optimization objectives. The results indicate the importance of setting optimization objectives dynamically during training.\",\"PeriodicalId\":13206,\"journal\":{\"name\":\"IEEE Transactions on Evolutionary Computation\",\"volume\":\"29 6\",\"pages\":\"2372-2385\"},\"PeriodicalIF\":15.9000,\"publicationDate\":\"2025-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10602526/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2024/7/18 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10602526/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/7/18 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

多目标进化学习(MOEL)已经证明了其训练更公平的机器学习模型的优势,该模型考虑了一组预定义的冲突目标,包括准确性和不同的公平度量。最近的研究提出构建一个具有代表性的公平度量子集作为模型训练过程中模型模型的优化目标。然而,代表性度量集的确定依赖于数据集、先验知识,并且需要大量的计算成本。更重要的是,这些代表性的测量可能在不同的模型训练过程中有所不同。本文提出在模型训练过程中在线动态自适应地确定具有代表性的度量集,而不是使用模型训练前确定的静态预定义集。然后将动态确定的代表集用作模型框架的优化目标,并且可以随时间变化。在12个知名基准数据集上的广泛实验结果表明,与最先进的方法相比,我们提出的框架在准确性和25个公平措施方面取得了出色的性能,尽管其中只有少数是动态选择并用作优化目标的。结果表明了在训练过程中动态设置优化目标的重要性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fairness-Aware Multiobjective Evolutionary Learning
Multiobjective evolutionary learning (MOEL) has demonstrated its advantages of training fairer machine learning models considering a predefined set of conflicting objectives, including accuracy and different fairness measures. Recent works propose to construct a representative subset of fairness measures as optimization objectives of MOEL throughout model training. However, the determination of a representative measure set relies on the dataset, prior knowledge, and requires substantial computational costs. What is more, those representative measures may differ across different model training processes. Instead of using a static predefined set determined before model training, this article proposes to dynamically and adaptively determine a representative measure set online during the model training. The dynamically determined representative set is then used as optimizing objectives of the MOEL framework and can vary with time. Extensive experimental results on 12 well-known benchmark datasets demonstrate that our proposed framework achieves outstanding performance compared to the state-of-the-art approaches for mitigating unfairness in terms of accuracy as well as 25 fairness measures although only a few of them were dynamically selected and used as optimization objectives. The results indicate the importance of setting optimization objectives dynamically during training.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation 工程技术-计算机:理论方法
CiteScore
21.90
自引率
9.80%
发文量
196
审稿时长
3.6 months
期刊介绍: The IEEE Transactions on Evolutionary Computation is published by the IEEE Computational Intelligence Society on behalf of 13 societies: Circuits and Systems; Computer; Control Systems; Engineering in Medicine and Biology; Industrial Electronics; Industry Applications; Lasers and Electro-Optics; Oceanic Engineering; Power Engineering; Robotics and Automation; Signal Processing; Social Implications of Technology; and Systems, Man, and Cybernetics. The journal publishes original papers in evolutionary computation and related areas such as nature-inspired algorithms, population-based methods, optimization, and hybrid systems. It welcomes both purely theoretical papers and application papers that provide general insights into these areas of computation.
期刊最新文献
Integrating Analytical Physics with LLM-Guided Reward Evolution in Reinforcement Learning DS-PSO: A Distance-Aware and Space-Mapped Particle Swarm Optimization Algorithm Matrix-Based Role Adaptive Particle Swarm Optimization for Large-Scale Optimization Microscale Searching-Based Dynamic Constrained Multi-Objective Optimization for Uncrewed Aerial Vehicle Path Planning in Unknown Environments BBOPlace-Bench: Benchmarking Black-Box Optimization for Chip Placement
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1