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}
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.