Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms

DOI10.1145/2725494.2725508MaRDI QIDQ2981883zbMATH OpenOpenAlexFDO

Authors Duc-Cuong Dang, Per Kristian Lehre

Publication date 10 May 2017

Published in Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2725494.2725508

zbMATH Keywords

noisy optimisationnon-elitismruntime analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Run-time analysis of population-based evolutionary algorithm in noisy environments
• Robustness of populations in stochastic environments
• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
• Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
• Evolutionary algorithms in noisy environments: theoretical issues and guidelines for practise.

Cites work

• Absorption time of the Moran process
• Approximating fixation probabilities in the generalized Moran process
• scientific article; zbMATH DE number 3148873 (Why is no real title available?)
• On the fixation probability of superstars

Cited in

(23)

• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
• Genetic algorithms with noisy fitness
• Running time analysis of the (1+1)-EA for robust linear optimization
• Exponential upper bounds for the runtime of randomized search heuristics
• Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes
• Evolutionary optimisation of noisy multi-objective problems using confidence-based dynamic resampling
• Analysis of noisy evolutionary optimization when sampling fails
• Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
• The voting algorithm is robust to various noise models
• Run-time analysis of population-based evolutionary algorithm in noisy environments
• Evolution strategies with additive noise: a convergence rate lower bound
• MMAS versus population-based EA on a family of dynamic fitness functions
• The Benefit of Recombination in Noisy Evolutionary Search
• The benefits and limitations of voting mechanisms in evolutionary optimisation
• Noisy optimization complexity under locality assumption
• A data mining approach to evolutionary optimisation of noisy multi-objective problems
• Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms
• More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments
• The SLO hierarchy of pseudo-Boolean functions and runtime of evolutionary algorithms
• Comma selection outperforms plus selection on OneMax with randomly planted optima
• On the efficiency of nonelitist evolutionary algorithms in the case of sparsity of the level sets inconsistent with respect to the objective function
• Closed-Loop Generative Selection: Convergence, Memory, and Noisy Oracles
• Analysis of runtime of optimization algorithms for noisy functions over discrete codomains

This page was built for publication: Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2981883)