新闻热点:NSGA-II 的运行时间分析--可证明的交叉速度提升

Benjamin Doerr, Zhongdi Qu
{"title":"新闻热点:NSGA-II 的运行时间分析--可证明的交叉速度提升","authors":"Benjamin Doerr, Zhongdi Qu","doi":"10.1145/3583133.3595845","DOIUrl":null,"url":null,"abstract":"Very recently, the first mathematical runtime analyses for the NSGA-II, the most common multi-objective evolutionary algorithm, have been conducted. Continuing this research direction, we prove that the NSGA-II optimizes the OneJumpZeroJump benchmark asymptotically faster when crossover is employed. Together with a parallel independent work by Dang, Opris, Salehi, and Sudholt (also at AAAI 2023), this is the first time such an advantage of crossover is proven for the NSGA-II. Our arguments can be transferred to single-objective optimization. They then prove that crossover can speed up the (μ + 1) genetic algorithm in a different way and more pronounced than known before. Our experiments confirm the added value of crossover and show that the observed advantages are even larger than what our proofs can guarantee. This paper for the Hot-off-the-Press track at GECCO 2023 summarizes the work Benjamin Doerr, Zhongdi Qu. Runtime analysis for the NSGA-II: Provable speed-ups from crossover, Conference on Artificial Intelligence, AAAI 2023. AAAI Press, to appear. [13].","PeriodicalId":422029,"journal":{"name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hot off the Press: Runtime Analysis for the NSGA-II - Provable Speed-Ups From Crossover\",\"authors\":\"Benjamin Doerr, Zhongdi Qu\",\"doi\":\"10.1145/3583133.3595845\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Very recently, the first mathematical runtime analyses for the NSGA-II, the most common multi-objective evolutionary algorithm, have been conducted. Continuing this research direction, we prove that the NSGA-II optimizes the OneJumpZeroJump benchmark asymptotically faster when crossover is employed. Together with a parallel independent work by Dang, Opris, Salehi, and Sudholt (also at AAAI 2023), this is the first time such an advantage of crossover is proven for the NSGA-II. Our arguments can be transferred to single-objective optimization. They then prove that crossover can speed up the (μ + 1) genetic algorithm in a different way and more pronounced than known before. Our experiments confirm the added value of crossover and show that the observed advantages are even larger than what our proofs can guarantee. This paper for the Hot-off-the-Press track at GECCO 2023 summarizes the work Benjamin Doerr, Zhongdi Qu. Runtime analysis for the NSGA-II: Provable speed-ups from crossover, Conference on Artificial Intelligence, AAAI 2023. AAAI Press, to appear. [13].\",\"PeriodicalId\":422029,\"journal\":{\"name\":\"Proceedings of the Companion Conference on Genetic and Evolutionary Computation\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Companion Conference on Genetic and Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3583133.3595845\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3583133.3595845","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最近,我们首次对最常见的多目标进化算法 NSGA-II 进行了运行时间数学分析。在继续这一研究方向的同时,我们证明了当采用交叉时,NSGA-II 优化 OneJumpZeroJump 基准的速度会逐渐加快。与 Dang、Opris、Salehi 和 Sudholt 的并行独立工作(也是在 AAAI 2023 上)一起,这是首次证明 NSGA-II 的交叉优势。我们的论证可以应用于单目标优化。我们的论点可以转移到单目标优化中,然后证明交叉可以以不同的方式加快 (μ + 1) 遗传算法的速度,而且比之前已知的方式更加明显。我们的实验证实了交叉的附加值,并表明观察到的优势比我们的证明所能保证的还要大。这篇在 GECCO 2023 大会 "新闻热点"(Hot-off-the-Press track)上发表的论文总结了 Benjamin Doerr 和 Zhongdi Qu 的工作。NSGA-II 的运行时间分析:来自交叉的可证明加速,人工智能大会,AAAI 2023。AAAI Press, to appear.[13].
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hot off the Press: Runtime Analysis for the NSGA-II - Provable Speed-Ups From Crossover
Very recently, the first mathematical runtime analyses for the NSGA-II, the most common multi-objective evolutionary algorithm, have been conducted. Continuing this research direction, we prove that the NSGA-II optimizes the OneJumpZeroJump benchmark asymptotically faster when crossover is employed. Together with a parallel independent work by Dang, Opris, Salehi, and Sudholt (also at AAAI 2023), this is the first time such an advantage of crossover is proven for the NSGA-II. Our arguments can be transferred to single-objective optimization. They then prove that crossover can speed up the (μ + 1) genetic algorithm in a different way and more pronounced than known before. Our experiments confirm the added value of crossover and show that the observed advantages are even larger than what our proofs can guarantee. This paper for the Hot-off-the-Press track at GECCO 2023 summarizes the work Benjamin Doerr, Zhongdi Qu. Runtime analysis for the NSGA-II: Provable speed-ups from crossover, Conference on Artificial Intelligence, AAAI 2023. AAAI Press, to appear. [13].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信