针对昂贵优化的具有竞争性知识转移的代理辅助搜索

Xiaoming Xue, Yao Hu, Liang Feng, Kai Zhang, Linqi Song, Kay Chen Tan
{"title":"针对昂贵优化的具有竞争性知识转移的代理辅助搜索","authors":"Xiaoming Xue, Yao Hu, Liang Feng, Kai Zhang, Linqi Song, Kay Chen Tan","doi":"arxiv-2408.07176","DOIUrl":null,"url":null,"abstract":"Expensive optimization problems (EOPs) have attracted increasing research\nattention over the decades due to their ubiquity in a variety of practical\napplications. Despite many sophisticated surrogate-assisted evolutionary\nalgorithms (SAEAs) that have been developed for solving such problems, most of\nthem lack the ability to transfer knowledge from previously-solved tasks and\nalways start their search from scratch, making them troubled by the notorious\ncold-start issue. A few preliminary studies that integrate transfer learning\ninto SAEAs still face some issues, such as defective similarity quantification\nthat is prone to underestimate promising knowledge, surrogate-dependency that\nmakes the transfer methods not coherent with the state-of-the-art in SAEAs,\netc. In light of the above, a plug and play competitive knowledge transfer\nmethod is proposed to boost various SAEAs in this paper. Specifically, both the\noptimized solutions from the source tasks and the promising solutions acquired\nby the target surrogate are treated as task-solving knowledge, enabling them to\ncompete with each other to elect the winner for expensive evaluation, thus\nboosting the search speed on the target task. Moreover, the lower bound of the\nconvergence gain brought by the knowledge competition is mathematically\nanalyzed, which is expected to strengthen the theoretical foundation of\nsequential transfer optimization. Experimental studies conducted on a series of\nbenchmark problems and a practical application from the petroleum industry\nverify the efficacy of the proposed method. The source code of the competitive\nknowledge transfer is available at https://github.com/XmingHsueh/SAS-CKT.","PeriodicalId":501347,"journal":{"name":"arXiv - CS - Neural and Evolutionary Computing","volume":"23 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Surrogate-Assisted Search with Competitive Knowledge Transfer for Expensive Optimization\",\"authors\":\"Xiaoming Xue, Yao Hu, Liang Feng, Kai Zhang, Linqi Song, Kay Chen Tan\",\"doi\":\"arxiv-2408.07176\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Expensive optimization problems (EOPs) have attracted increasing research\\nattention over the decades due to their ubiquity in a variety of practical\\napplications. Despite many sophisticated surrogate-assisted evolutionary\\nalgorithms (SAEAs) that have been developed for solving such problems, most of\\nthem lack the ability to transfer knowledge from previously-solved tasks and\\nalways start their search from scratch, making them troubled by the notorious\\ncold-start issue. A few preliminary studies that integrate transfer learning\\ninto SAEAs still face some issues, such as defective similarity quantification\\nthat is prone to underestimate promising knowledge, surrogate-dependency that\\nmakes the transfer methods not coherent with the state-of-the-art in SAEAs,\\netc. In light of the above, a plug and play competitive knowledge transfer\\nmethod is proposed to boost various SAEAs in this paper. Specifically, both the\\noptimized solutions from the source tasks and the promising solutions acquired\\nby the target surrogate are treated as task-solving knowledge, enabling them to\\ncompete with each other to elect the winner for expensive evaluation, thus\\nboosting the search speed on the target task. Moreover, the lower bound of the\\nconvergence gain brought by the knowledge competition is mathematically\\nanalyzed, which is expected to strengthen the theoretical foundation of\\nsequential transfer optimization. Experimental studies conducted on a series of\\nbenchmark problems and a practical application from the petroleum industry\\nverify the efficacy of the proposed method. The source code of the competitive\\nknowledge transfer is available at https://github.com/XmingHsueh/SAS-CKT.\",\"PeriodicalId\":501347,\"journal\":{\"name\":\"arXiv - CS - Neural and Evolutionary Computing\",\"volume\":\"23 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Neural and Evolutionary Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.07176\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Neural and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.07176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

几十年来,昂贵的优化问题(EOPs)在各种实际应用中无处不在,因此吸引了越来越多的研究关注。尽管为解决这类问题开发了许多复杂的代理辅助进化算法(SAEAs),但它们大多缺乏从以前解决过的任务中迁移知识的能力,总是从头开始搜索,这使它们受到臭名昭著的冷启动问题的困扰。一些将迁移学习集成到SAEAs中的初步研究仍然面临着一些问题,如相似性量化存在缺陷,容易低估有潜力的知识;代用依赖性使迁移方法与SAEAs的最新技术不一致等。有鉴于此,本文提出了一种即插即用的竞争性知识转移方法,以促进各种 SAEA 的发展。具体来说,源任务中的优化方案和目标代理任务中获得的有前途的方案都被视为任务解决知识,使它们能够相互竞争,选出优胜者进行昂贵的评估,从而提高目标任务的搜索速度。此外,还对知识竞争带来的收敛增益的下限进行了数学分析,从而有望加强后继转移优化的理论基础。在一系列基准问题上进行的实验研究和石油行业的实际应用验证了所提方法的有效性。竞争性知识转移的源代码可在 https://github.com/XmingHsueh/SAS-CKT 上获取。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Surrogate-Assisted Search with Competitive Knowledge Transfer for Expensive Optimization
Expensive optimization problems (EOPs) have attracted increasing research attention over the decades due to their ubiquity in a variety of practical applications. Despite many sophisticated surrogate-assisted evolutionary algorithms (SAEAs) that have been developed for solving such problems, most of them lack the ability to transfer knowledge from previously-solved tasks and always start their search from scratch, making them troubled by the notorious cold-start issue. A few preliminary studies that integrate transfer learning into SAEAs still face some issues, such as defective similarity quantification that is prone to underestimate promising knowledge, surrogate-dependency that makes the transfer methods not coherent with the state-of-the-art in SAEAs, etc. In light of the above, a plug and play competitive knowledge transfer method is proposed to boost various SAEAs in this paper. Specifically, both the optimized solutions from the source tasks and the promising solutions acquired by the target surrogate are treated as task-solving knowledge, enabling them to compete with each other to elect the winner for expensive evaluation, thus boosting the search speed on the target task. Moreover, the lower bound of the convergence gain brought by the knowledge competition is mathematically analyzed, which is expected to strengthen the theoretical foundation of sequential transfer optimization. Experimental studies conducted on a series of benchmark problems and a practical application from the petroleum industry verify the efficacy of the proposed method. The source code of the competitive knowledge transfer is available at https://github.com/XmingHsueh/SAS-CKT.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信