Evolutionary Optimization with Simplified Helper Task for High-dimensional Expensive Multiobjective Problems

Xunfeng Wu, Qiuzhen Lin, Junwei Zhou, Songbai Liu, C. C. Coello Coello, Victor C. M. Leung
{"title":"Evolutionary Optimization with Simplified Helper Task for High-dimensional Expensive Multiobjective Problems","authors":"Xunfeng Wu, Qiuzhen Lin, Junwei Zhou, Songbai Liu, C. C. Coello Coello, Victor C. M. Leung","doi":"10.1145/3637065","DOIUrl":null,"url":null,"abstract":"In recent years, surrogate-assisted evolutionary algorithms (SAEAs) have been sufficiently studied for tackling computationally expensive multiobjective optimization problems (EMOPs), as they can quickly estimate the qualities of solutions by using surrogate models to substitute for expensive evaluations. However, most existing SAEAs only show promising performance for solving EMOPs with no more than 10 dimensions, and become less efficient for tackling EMOPs with higher dimensionality. Thus, this article proposes a new SAEA with a simplified helper task for tackling high-dimensional EMOPs. In each generation, one simplified task will be generated artificially by using random dimension reduction on the target task (i.e., the target EMOPs). Then, two surrogate models are trained for the helper task and the target task, respectively. Based on the trained surrogate models, evolutionary multitasking optimization is run to solve these two tasks, so that the experiences of solving the helper task can be transferred to speed up the convergence of tackling the target task. Moreover, an effective model management strategy is designed to select new promising samples for training the surrogate models. When compared to five competitive SAEAs on four well-known benchmark suites, the experiments validate the advantages of the proposed algorithm on most test cases.","PeriodicalId":220659,"journal":{"name":"ACM Transactions on Evolutionary Learning","volume":" 9","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Evolutionary Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3637065","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, surrogate-assisted evolutionary algorithms (SAEAs) have been sufficiently studied for tackling computationally expensive multiobjective optimization problems (EMOPs), as they can quickly estimate the qualities of solutions by using surrogate models to substitute for expensive evaluations. However, most existing SAEAs only show promising performance for solving EMOPs with no more than 10 dimensions, and become less efficient for tackling EMOPs with higher dimensionality. Thus, this article proposes a new SAEA with a simplified helper task for tackling high-dimensional EMOPs. In each generation, one simplified task will be generated artificially by using random dimension reduction on the target task (i.e., the target EMOPs). Then, two surrogate models are trained for the helper task and the target task, respectively. Based on the trained surrogate models, evolutionary multitasking optimization is run to solve these two tasks, so that the experiences of solving the helper task can be transferred to speed up the convergence of tackling the target task. Moreover, an effective model management strategy is designed to select new promising samples for training the surrogate models. When compared to five competitive SAEAs on four well-known benchmark suites, the experiments validate the advantages of the proposed algorithm on most test cases.
针对高维昂贵多目标问题的简化辅助任务进化优化法
近年来,代用辅助进化算法(SAEAs)在解决计算成本高昂的多目标优化问题(EMOPs)方面得到了充分研究,因为它们可以通过使用代用模型来替代昂贵的评估,从而快速估计解决方案的质量。然而,大多数现有的 SAEA 只在求解不超过 10 维的 EMOP 时表现出良好的性能,而在求解维数更高的 EMOP 时,其效率就会降低。因此,本文提出了一种带有简化辅助任务的新 SAEA,用于解决高维 EMOP。在每一代中,将通过对目标任务(即目标 EMOPs)进行随机降维,人为生成一个简化任务。然后,分别为辅助任务和目标任务训练两个代理模型。在训练好的代用模型的基础上,运行进化多任务优化来解决这两个任务,从而将解决辅助任务的经验用于加速目标任务的收敛。此外,还设计了有效的模型管理策略,以选择新的有前途的样本来训练代用模型。与四个著名基准套件上的五个竞争性 SAEA 相比,实验验证了所提算法在大多数测试案例中的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信