The theory of evolution strategies
The theory of evolution strategies
Numerical Optimization of Computer Models
Numerical Optimization of Computer Models
On The Convergence Properties Of A Simple Self-adaptive Evolutionary Algorithm
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Convergence Velocity Of Evolutionary Algorithm With Self-adaptation
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Theoretical Computer Science
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
Local and global order 3/2 convergence of a surrogate evolutionary algorithm
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Learning environment dynamics from self-adaptation: a preliminary investigation
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Reconsidering the progress rate theory for evolution strategies in finite dimensions
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Comparison-based algorithms are robust and randomized algorithms are anytime
Evolutionary Computation
Convergence Analysis of Evolution Strategies with Random Numbers of Offspring
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Lower Bounds for Evolution Strategies Using VC-Dimension
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Neuroevolution strategies for episodic reinforcement learning
Journal of Algorithms
Evolutionary optimization of dynamics models in sequential Monte Carlo target tracking
IEEE Transactions on Evolutionary Computation
Mutative self-adaptation on the sharp and parabolic ridge
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Conditioning, halting criteria and choosing λ
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Log-linear convergence and optimal bounds for the (1 + 1)-ES
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Theoretical analysis of evolutionary computation on continuously differentiable functions
Proceedings of the 12th annual conference on Genetic and evolutionary computation
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Bandit-based estimation of distribution algorithms for noisy optimization: rigorous runtime analysis
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Analyzing the impact of mirrored sampling and sequential selection in elitist evolution strategies
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Preference-based policy learning
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
General lower bounds for evolutionary algorithms
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Self-adaptation on the ridge function class: first results for the sharp ridge
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Algorithms (x, sigma, eta): quasi-random mutations for evolution strategies
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Natural evolution strategies converge on sphere functions
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Analysis of a natural gradient algorithm on monotonic convex-quadratic-composite functions
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Convergence of the IGO-Flow of isotropic gaussian distributions on convex quadratic problems
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Noisy optimization complexity under locality assumption
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Noisy optimization convergence rates
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 5.23 |
This paper investigates theoretically the (1, λ)-SA-ES on the well known sphere function. We prove sufficient conditions on the parameters of the algorithm ensuring the convergence of 1/n ln(||Xn||), where Xn is the parent at generation n. This in turn guarantees the asymptotic log-linear convergence or divergence of the algorithm. The technique used for this analysis calls upon the theory of Markov chains on a continuous state space and on the so-called Foster-Lyapunov drift conditions. Those conditions enable us to derive practical conditions that prove stability properties of Markov chains.