A Self-adaptive Multi-task Differential Evolution Algorithm

Kangjia Qiao, Jing J. Liang, Kunjie Yu, B. Qu, C. Yue, Gongping Li
{"title":"A Self-adaptive Multi-task Differential Evolution Algorithm","authors":"Kangjia Qiao, Jing J. Liang, Kunjie Yu, B. Qu, C. Yue, Gongping Li","doi":"10.1109/acait53529.2021.9731130","DOIUrl":null,"url":null,"abstract":"This paper proposes a new self-adaptive scheme and differential evolution based evolutionary multi-task optimization algorithm to address multiple different optimization problems or tasks simultaneously. The proposed algorithm assigns a specific population and a transfer rate for each task and uses the differential evolution strategies to update each population. Compared with traditional evolutionary multi-task optimization algorithms that adopt a fixed transfer rate, the proposed algorithm uses a self-adaptive scheme to dynamically adjust transfer rate, which reduces the harm of negative transfer on the evolutionary direction of the population. The population is simultaneously driven by the information from the intra-task and other tasks. Based on the performance of the two evolutionary strategies, the population adaptively adjusts the transfer rate to complete the high-quality knowledge transfer process. The experiment is conducted on the single-objective multi-task test suite. The results show that the proposed algorithm can find more accurate solutions with a faster convergence rate in comparison with several state-of-the-art evolutionary multi-task optimization algorithms.","PeriodicalId":173633,"journal":{"name":"2021 5th Asian Conference on Artificial Intelligence Technology (ACAIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 5th Asian Conference on Artificial Intelligence Technology (ACAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/acait53529.2021.9731130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a new self-adaptive scheme and differential evolution based evolutionary multi-task optimization algorithm to address multiple different optimization problems or tasks simultaneously. The proposed algorithm assigns a specific population and a transfer rate for each task and uses the differential evolution strategies to update each population. Compared with traditional evolutionary multi-task optimization algorithms that adopt a fixed transfer rate, the proposed algorithm uses a self-adaptive scheme to dynamically adjust transfer rate, which reduces the harm of negative transfer on the evolutionary direction of the population. The population is simultaneously driven by the information from the intra-task and other tasks. Based on the performance of the two evolutionary strategies, the population adaptively adjusts the transfer rate to complete the high-quality knowledge transfer process. The experiment is conducted on the single-objective multi-task test suite. The results show that the proposed algorithm can find more accurate solutions with a faster convergence rate in comparison with several state-of-the-art evolutionary multi-task optimization algorithms.
一种自适应多任务差分进化算法
本文提出了一种新的自适应方案和基于差分进化的进化多任务优化算法,以同时解决多个不同的优化问题或任务。该算法为每个任务分配特定的种群和传输速率,并使用差分进化策略更新每个种群。与传统采用固定迁移速率的进化多任务优化算法相比,该算法采用自适应方案动态调整迁移速率,减少了负迁移对种群进化方向的危害。人口同时受到来自任务内部和其他任务的信息的驱动。基于这两种进化策略的表现,种群自适应地调整迁移速率,以完成高质量的知识迁移过程。实验是在单目标多任务测试套件上进行的。结果表明,与几种先进的进化多任务优化算法相比,该算法能以更快的收敛速度找到更精确的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信