Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms
From MaRDI portal
Publication:6120976
Cites work
- Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
- Analysis of noisy evolutionary optimization when sampling fails
- Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms
- Multiplicative up-drift
- On the analysis of the \((1+1)\) evolutionary algorithm
- Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
- Robustness of populations in stochastic environments
- Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
- Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes
- Runtime analysis for self-adaptive mutation rates
- Self-adjusting offspring population sizes outperform fixed parameters on the cliff function
Cited in
(3)- A flexible evolutionary algorithm with dynamic mutation rate archive
- On the efficiency of nonelitist evolutionary algorithms in the case of sparsity of the level sets inconsistent with respect to the objective function
- Selection hyper-heuristics can automatically adjust the learning period to optimally solve pseudo-Boolean problems
This page was built for publication: Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120976)