## Crynodeb

Most evolutionary algorithms have parameters, which allow a great flexibility in controlling their behavior and adapting them to new problems. To achieve the best performance, it is often needed to control some of the parameters during optimization, which gave rise to various parameter control methods. In recent works, however, similar advantages have been shown, and even proven, for sampling parameter values from certain, often heavy-tailed, fixed distributions. This produced a family of algorithms currently known as "fast evolution strategies" and "fast genetic algorithms".

However, only little is known so far about the influence of these distributions on the performance of evolutionary algorithms, and about the relationships between (dynamic) parameter control and (static) parameter sampling. We contribute to the body of knowledge by presenting an algorithm that computes the optimal static distributions, which describe the mutation operator used in the well-known simple (1+λ) evolutionary algorithm on a classic benchmark problem OneMax. We show that, for large enough population sizes, such optimal distributions may be surprisingly complicated and counter-intuitive. We investigate certain properties of these distributions, and also evaluate the performance regrets of the (1 + λ) evolutionary algorithm using standard mutation operators.

However, only little is known so far about the influence of these distributions on the performance of evolutionary algorithms, and about the relationships between (dynamic) parameter control and (static) parameter sampling. We contribute to the body of knowledge by presenting an algorithm that computes the optimal static distributions, which describe the mutation operator used in the well-known simple (1+λ) evolutionary algorithm on a classic benchmark problem OneMax. We show that, for large enough population sizes, such optimal distributions may be surprisingly complicated and counter-intuitive. We investigate certain properties of these distributions, and also evaluate the performance regrets of the (1 + λ) evolutionary algorithm using standard mutation operators.

Iaith wreiddiol | Saesneg |
---|---|

Teitl | GECCO '21 |

Is-deitl | Proceedings of the Genetic and Evolutionary Computation Conference |

Golygyddion | Francisco Chicano |

Cyhoeddwr | Association for Computing Machinery |

Tudalennau | 660-668 |

Nifer y tudalennau | 9 |

ISBN (Argraffiad) | 978-1-4503-8350-9 |

Dynodwyr Gwrthrych Digidol (DOIs) | |

Statws | Cyhoeddwyd - 26 Meh 2021 |

Cyhoeddwyd yn allanol | Ie |

Digwyddiad | GECCO 2021 -Genetic and Evolutionary Computation Conference - Lille, Ffrainc Hyd: 10 Gorff 2021 → 14 Gorff 2021 |

### Cynhadledd

Cynhadledd | GECCO 2021 -Genetic and Evolutionary Computation Conference |
---|---|

Gwlad/Tiriogaeth | Ffrainc |

Dinas | Lille |

Cyfnod | 10 Gorff 2021 → 14 Gorff 2021 |