The theory of evolution strategies
The theory of evolution strategies
Noisy Local Optimization with Evolution Strategies
Noisy Local Optimization with Evolution Strategies
A Comparison of Evolution Strategies with Other Direct Search Methods in the Presence of Noise
Computational Optimization and Applications
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Step-Size Adaption Based on Non-Local Use of Selection Information
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
On the Asymptotic Behavior of Multirecombinant Evolution Strategies
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Learning probability distributions in continuous evolutionary algorithms– a comparative review
Natural Computing: an international journal
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
Toward a theory of evolution strategies: On the benefits of sex---the (μ/μ, λ) theory
Evolutionary Computation
Evolutionary algorithms and gradient search: similarities anddifferences
IEEE Transactions on Evolutionary Computation
Lower Bounds for Evolution Strategies Using VC-Dimension
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge
Natural Computing: an international journal
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
How to Do Recombination in Evolution Strategies: An Empirical Study
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
Cumulative step length adaptation for evolution strategies using negative recombination weights
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Analyzing the impact of mirrored sampling and sequential selection in elitist evolution strategies
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Mirrored sampling in evolution strategies with weighted recombination
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Theoretical Computer Science
Investigating the local-meta-model CMA-ES for large population sizes
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
| Hi-index | 0.00 |
Weighted recombination is a means for improving the local search performance of evolution strategies. It aims to make effective use of the information available, without significantly increasing computational costs per time step. In this paper, the potential speed-up resulting from using rank-based weighted recombination is investigated. Optimal weights are computed for the sphere model, and comparisons with the performance of strategies that do not make use of weighted recombination are presented. It is seen that unlike strategies that rely on unweighted recombination and truncation selection, weighted multirecombination evolution strategies are able to improve on the serial efficiency of the (1+1)-ES on the sphere. The implications of the use of weighted recombination for noisy optimization are studied, and parallels to the use of rescaled mutations are drawn. The cumulative step length adaptation mechanism is formulated for the case of an optimally weighted evolution strategy, and its performance is analyzed.