Surrogate-Assisted Task Selection for Evolutionary Multitasking Optimization

Kaiyuan Huang, Xiaojun Wang, Yiqiao Cai
{"title":"Surrogate-Assisted Task Selection for Evolutionary Multitasking Optimization","authors":"Kaiyuan Huang, Xiaojun Wang, Yiqiao Cai","doi":"10.1109/seai55746.2022.9832367","DOIUrl":null,"url":null,"abstract":"In the evolution algorithm, evolutionary multi-task optimization (EMTO) is recently proposed as a novel optimization paradigm for simultaneously solving multiple optimization tasks. However, in most of the existing EMTO algorithms, each offspring is evaluated selectively for only one task that is randomly assigned. This will lead to the negative transfer if the relatedness between tasks is lower. Based on this consideration, a novel surrogate-assisted task selection (SATS) method is proposed to assign a proper task to the offspring for evaluation by a collaborative multioutput Gaussian process surrogate (CoMOGP). The main purpose of SATS is to exploit the relatedness across tasks by jointly learning a surrogate model that is used for predicting the skill factor of each offspring, which will alleviate negative transfer. By incorporating the proposed SATS into a representative EMTO, multifactorial evolution algorithm (MFEA), an improved EMTO algorithm, termed SATS-EMO, is presented. Experimental results on a suite of single-objective multitasking benchmark problems have demonstrated the effectiveness of SATS for EMTO.","PeriodicalId":290416,"journal":{"name":"2022 IEEE 2nd International Conference on Software Engineering and Artificial Intelligence (SEAI)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 2nd International Conference on Software Engineering and Artificial Intelligence (SEAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/seai55746.2022.9832367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the evolution algorithm, evolutionary multi-task optimization (EMTO) is recently proposed as a novel optimization paradigm for simultaneously solving multiple optimization tasks. However, in most of the existing EMTO algorithms, each offspring is evaluated selectively for only one task that is randomly assigned. This will lead to the negative transfer if the relatedness between tasks is lower. Based on this consideration, a novel surrogate-assisted task selection (SATS) method is proposed to assign a proper task to the offspring for evaluation by a collaborative multioutput Gaussian process surrogate (CoMOGP). The main purpose of SATS is to exploit the relatedness across tasks by jointly learning a surrogate model that is used for predicting the skill factor of each offspring, which will alleviate negative transfer. By incorporating the proposed SATS into a representative EMTO, multifactorial evolution algorithm (MFEA), an improved EMTO algorithm, termed SATS-EMO, is presented. Experimental results on a suite of single-objective multitasking benchmark problems have demonstrated the effectiveness of SATS for EMTO.
进化多任务优化中的代理辅助任务选择
在进化算法中,进化多任务优化(EMTO)作为一种同时求解多个优化任务的新型优化范式被提出。然而,在大多数现有的EMTO算法中,每个子代只对随机分配的一个任务进行选择性评估。如果任务之间的关联度较低,就会导致负迁移。在此基础上,提出了一种新的代理辅助任务选择(SATS)方法,通过协作多输出高斯过程代理(CoMOGP)将合适的任务分配给后代进行评估。SATS的主要目的是通过共同学习一个代理模型来预测每个后代的技能因子,从而利用任务间的相关性,从而减轻负迁移。通过将所提出的多因子进化算法(MFEA)与典型的EMTO相结合,提出了一种改进的EMTO算法,称为sat - emo。在一组单目标多任务基准问题上的实验结果证明了SATS对EMTO的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书