paper-with-me

홈 › Papers

The 1/5-th Rule with Rollbacks: On Self-Adjustment of the Population Size in the $(1+(λ,λ))$ GA

2019-04-15 · Anton Bassin, Maxim Buzdalov

Self-adjustment of parameters can significantly improve the performance of evolutionary algorithms. A notable example is the $(1+(\lambda,\lambda))$ genetic algorithm, where the adaptation of the population size helps to achieve the linear runtime on the OneMax problem. However, on problems which interfere with the assumptions behind the self-adjustment procedure, its usage can lead to performance degradation compared to static parameter choices. In particular, the one fifth rule, which guides the adaptation in the example above, is able to raise the population size too fast on problems which are too far away from the perfect fitness-distance correlation. We propose a modification of the one fifth rule in order to have less negative impact on the performance in scenarios when the original rule reduces the performance. Our modification, while still having a good performance on OneMax, both theoretically and in practice, also shows better results on linear functions with random weights and on random satisfiable MAX-SAT instances.

📄 PDF Abstract BibTeX arXiv:1904.07284

Code (0)

등록된 구현이 없습니다.

Tasks

Evolutionary Algorithms

Similar Papers 제목 키워드 기반

Hard Problems are Easier for Success-based Parameter Control

2022-04-12 · Mario Alejandro Hevia Fajardo, Dirk Sudholt

Recent works showed that simple success-based rules for self-adjusting parameters in evolutionary algorithms (EAs) can match or outperform the best fixed parameters on discrete problems. Non-elitism in a (1,$\lambda$) EA…

Evolutionary Algorithms

Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings

2015-04-13 · Benjamin Doerr, Carola Doerr

While evolutionary algorithms are known to be very successful for a broad range of applications, the algorithm designer is often left with many algorithmic choices, for example, the size of the population, the mutation r…

Evolutionary Algorithms

Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates

2019-04-17 · Anna Rodionova, Kirill Antonov, Arina Buzdalova, Carola Doerr

We analyze the performance of the 2-rate $(1+\lambda)$ Evolutionary Algorithm (EA) with self-adjusting mutation rate control, its 3-rate counterpart, and a $(1+\lambda)$~EA variant using multiplicative update rules on th…

Evolutionary Algorithms

OneMax is not the Easiest Function for Fitness Improvements

2022-04-14 · Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou

We study the $(1:s+1)$ success rule for controlling the population size of the $(1,\lambda)$-EA. It was shown by Hevia Fajardo and Sudholt that this parameter control mechanism can run into problems for large $s$ if the …

Efficient adjustment sets for population average treatment effect estimation in non-parametric causal graphical models

2019-12-01 · Andrea Rotnitzky, Ezequiel Smucler

The method of covariate adjustment is often used for estimation of population average treatment effects in observational studies. Graphical rules for determining all valid covariate adjustment sets from an assumed causal…

valid