Analysis of noisy evolutionary optimization when sampling fails
From MaRDI portal
Publication:2661993
DOI10.1007/s00453-019-00666-6OpenAlexW3002251818WikidataQ126329573 ScholiaQ126329573MaRDI QIDQ2661993
Chao Qian, Xin Yao, Ke Tang, Chao Bian, Yang Yu
Publication date: 8 April 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.05045
Related Items (4)
Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms ⋮ The cost of randomness in evolutionary algorithms: crossover can save random bits ⋮ More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments ⋮ Modeling the dynamics of a changing range genetic algorithm in noisy environments
Cites Work
- Unnamed Item
- Robustness of populations in stochastic environments
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Simplified drift analysis for proving lower bounds in evolutionary computation
- Analysis of runtime of optimization algorithms for noisy functions over discrete codomains
- Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
- A simple ant colony optimizer for stochastic shortest path problems
- Multiplicative drift analysis
- On the runtime analysis of the simple genetic algorithm
- Evolutionary optimisation of noisy multi-objective problems using confidence-based dynamic resampling
- Efficient Optimisation of Noisy Fitness Functions with Population-based Evolutionary Algorithms
- Run-Time Analysis of Population-Based Evolutionary Algorithm in Noisy Environments
- Refinement of the upper bounds of the constants in Lyapunov's theorem
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- Evolutionary Learning: Advances in Theories and Algorithms
- Optimizing expected path lengths with ant colony optimization using fitness proportional update
- Combinatorial methods in density estimation
- Drift analysis and average time complexity of evolutionary algorithms
This page was built for publication: Analysis of noisy evolutionary optimization when sampling fails
