paper-with-me

Papers

Abnormal Mutations: Evolution Strategies Don't Require Gaussianity

2025-02-05 · Jacob de Nobel, Diederick Vermetten, Hao Wang, Anna V. Kononova, Günter Rudolph, Thomas Bäck

The mutation process in evolution strategies has been interlinked with the normal distribution since its inception. Many lines of reasoning have been given for this strong dependency, ranging from maximum entropy arguments to the need for isotropy. However, some theoretical results suggest that other distributions might lead to similar local convergence properties. This paper empirically shows that a wide range of evolutionary strategies, from the (1+1)-ES to CMA-ES, show comparable optimization performance when using a mutation distribution other than the standard Gaussian. Replacing it with, e.g., uniformly distributed mutations, does not deteriorate the performance of ES, when using the default adaptation mechanism for the strategy parameters. We observe that these results hold not only for the sphere model but also for a wider range of benchmark problems.

📄 PDF Abstract BibTeX arXiv:2502.03148

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Robustness, Evolvability and Phenotypic Complexity: Insights from Evolving Digital Circuits

2017-12-12 · Nicola Milano, Paolo Pagliuca, Stefano Nolfi

We show how the characteristics of the evolutionary algorithm influence the evolvability of candidate solutions, i.e. the propensity of evolving individuals to generate better solutions as a result of genetic variation. …

A Survey and Analysis of Evolutionary Operators for Permutations

2023-11-24 · Vincent A. Cicirello

There are many combinatorial optimization problems whose solutions are best represented by permutations. The classic traveling salesperson seeks an optimal ordering over a set of cities. Scheduling problems often seek op…

Combinatorial OptimizationEvolutionary AlgorithmsSchedulingSurvey

On the Covariance-Hessian Relation in Evolution Strategies

2018-06-10 · Ofer M. Shir, Amir Yehudayoff

We consider Evolution Strategies operating only with isotropic Gaussian mutations on positive quadratic objective functions, and investigate the covariance matrix when constructed out of selected individuals by truncatio…

Relation

Sparse Mutation Decompositions: Fine Tuning Deep Neural Networks with Subspace Evolution

2023-02-12 · Tim Whitaker, Darrell Whitley

Neuroevolution is a promising area of research that combines evolutionary algorithms with neural networks. A popular subclass of neuroevolutionary methods, called evolution strategies, relies on dense noise perturbations…

DiversityEnsemble LearningEvolutionary Algorithms

Evolution of worker policing

2016-05-10

Workers in insect societies are sometimes observed to kill male eggs of other workers, a phenomenon known as worker policing. We perform a mathematical analysis of the evolutionary dynamics of policing. We investigate th…