Numerical Optimization of Computer Models
Numerical Optimization of Computer Models
Proceedings of the 6th International Conference on Genetic Algorithms
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
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
A derandomized approach to self-adaptation of evolution strategies
Evolutionary Computation
Toward a theory of evolution strategies: Self-adaptation
Evolutionary Computation
Evolutionary computation: comments on the history and current state
IEEE Transactions on Evolutionary Computation
A New Approach for Predicting the Final Outcome of Evolution Strategy Optimization Under Noise
Genetic Programming and Evolvable Machines
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Aiming for a theoretically tractable CSA variant by means of empirical investigations
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Step length adaptation on ridge functions
Evolutionary Computation
Covariance Matrix Adaptation Revisited --- The CMSA Evolution Strategy ---
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
IEEE Transactions on Evolutionary Computation - Special issue on computational finance and economics
Adaptive niche radii and niche shapes approaches for niching with the cma-es
Evolutionary Computation
The steady state behavior of (µ/µI, λ)-ES on ellipsoidal fitness models disturbed by noise
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
| Hi-index | 0.00 |
Cumulative step-size adaptation (CSA) based on path length control is regarded as a robust alternative to the standard mutative self-adaptation technique in evolution strategies (ES), guaranteeing an almost optimal control of the mutation operator. This paper shows that the underlying basic assumption in CSA - the perpendicularity of expected consecutive steps - does not necessarily guarantee optimal progress performance for (µ/µI,λ) intermediate recombinative ES.