Affiliation:
1. Department of Computer Science and Engineering, Michigan State University, East Lansing, 48823, USA
Abstract
The parameter-less population pyramid (P3) is a recently introduced method for performing evolutionary optimization without requiring any user-specified parameters. P3’s primary innovation is to replace the generational model with a pyramid of multiple populations that are iteratively created and expanded. In combination with local search and advanced crossover, P3 scales to problem difficulty, exploiting previously learned information before adding more diversity. Across seven problems, each tested using on average 18 problem sizes, P3 outperformed all five advanced comparison algorithms. This improvement includes requiring fewer evaluations to find the global optimum and better fitness when using the same number of evaluations. Using both algorithm analysis and comparison, we find P3’s effectiveness is due to its ability to properly maintain, add, and exploit diversity. Unlike the best comparison algorithms, P3 was able to achieve this quality without any problem-specific tuning. Thus, unlike previous parameter-less methods, P3 does not sacrifice quality for applicability. Therefore we conclude that P3 is an efficient, general, parameter-less approach to black box optimization which is more effective than existing state-of-the-art techniques.
Subject
Computational Mathematics
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. History-Guided Hill Exploration for Evolutionary Computation;IEEE Transactions on Evolutionary Computation;2023-12
2. Using Automated Algorithm Configuration for Parameter Control;Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms;2023-08-30
3. The Impact of Asynchrony on Parallel Model-Based EAs;Proceedings of the Genetic and Evolutionary Computation Conference;2023-07-12
4. Theoretical and Empirical Analysis of Parameter Control Mechanisms in the (1 + (λ, λ)) Genetic Algorithm;ACM Transactions on Evolutionary Learning and Optimization;2022-12-31
5. Recent developments in HNCO;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2022-07-09