Amine Boumaza
ABSTRACT
We present an experimental study that shows a relationship between the dynamics of the environment and the adaptation of strategy parameters. Experiments conducted on two adaptive evolutionary strategies SA-ES and CMA-ES on the dynamic sphere function, show that the nature of the movements of the function's optimum are reflected in the evolution of the mutation steps. Three types of movements are presented: constant, linear and quadratic velocity, in all, the evolution of mutation steps during adaptation reflect distinctly the nature of the movements. Furthermore with CMA-ES, the direction of movement of the optimum can be extracted.
- P. J. Angeline. Tracking extrema in dynamic environments. In P. J. Angeline, R. G. Reynolds, J. R. McDonnell, and R. Eberhart, editors, Proceedings of the 6th International Conference on Evolutionary Programming, volume 1213 of Lecture Notes in Computer Science, Indianapolis, Indiana, USA, April 13--16 1997. Springer Verlag. Google Scholar
Digital Library
- A. Auger. Convergence results for (1, λ)-SA-ES using the theory of φ-irreducible markov chains. Theoretical Computer Science, 2004. In press. Google ScholarDigital Library
- T. Bäck and H. P. Schwefel. Evolution strategies. In J. Périaux and G. Winter, editors, Genetic Algorithms in Engineering and Computer Science, chapter 6--7. John Wiley and Sons, 1995.Google Scholar
- T. Bäck. Self-adaptation in genetic algorithms. In F. J. Varela and P. Bourgine, editors, Proc. of the 1st European Conf. on Artificial Life, pages 227--235, Cambridge, MA, 1992. MIT Press.Google Scholar
- H.-G. Beyer. Evolution strategies: A comprehensive introduction. Natural Computing, 1(1):3--52, 2002. Google ScholarDigital Library
- H.-G. Beyer and K. Deb. On self-adaptive features in real-parameter evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 5(3):250--270, 2001. Google ScholarDigital Library
- J. Branke. Evolutionary Optimization in Dynamic Environments. Kluwer, 2001. Google ScholarDigital Library
- J. Branke and W. Wang. Theoretical analysis of simple evolution strategies in quickly changing environment. In E. Cantu-Paz et al., editor, Proceedings of the Genetic and Evolutionary Conference, pages 537--548. Springer, 2003. Google ScholarDigital Library
- L. J. Fogel, P. J. Angeline, and D. B. Fogel. An evolutionary programming approach to self-adaptation on finite state machines. In J. McDonnell, R. Reynolds, and D. Fogel, editors, In Evolutionary Programming IV: Proceedings of the Fourth Annual Conference on Evolutionary Programming., pages 355--366. MIT Press, 1995.Google Scholar
- N. Hansen, S. D. Müller, and P. Koumoutsakos. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evolutionary Computation, 11(1):1--18, 2003. Google ScholarDigital Library
- N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159--195, 2001. Google ScholarDigital Library
- R. Hinterding, Z. Michalewicz, and A. E. Eiben. Adaptation in evolutionary computation: A survey. In Proceedings of the 4th IEEE International Conference on Evolutionary Computation, pages 65--69, 1997.Google ScholarCross Ref
- A. Ostermeier, A. Gawelczyk, and N. Hansen. A derandomized approach to self-adaptation of evolution strategies. Evolutionary Computation, 2(4):369--38, 1994.Google ScholarDigital Library
- H. P. Schwefel. Numerical Optimisation of Computer Model. Wiley, 1981. Google ScholarDigital Library
Index Terms
- Learning environment dynamics from self-adaptation: a preliminary investigation
Recommendations
The ($$1+\lambda $$1+ý) Evolutionary Algorithm with Self-Adjusting Mutation Rate
We propose a new way to self-adjust the mutation rate in population-based evolutionary algorithms in discrete search spaces. Roughly speaking, it consists of creating half the offspring with a mutation rate that is twice the current mutation rate and ...
Neutrality and self-adaptation
Neutral genotype-phenotype mappings can be observed in natural evolution and are often used in evolutionary computation. In this article, important aspects of such encodings are analyzed.
First, it is shown that in the absence of external control ...
Self-adaptation via Multi-objectivisation: An Empirical Study
Parallel Problem Solving from Nature – PPSN XVIIAbstractNon-elitist evolutionary algorithms (EAs) can be beneficial in optimisation of noisy and or rugged fitness landscapes. However, this benefit can only be realised if the parameters of the non-elitist EAs are carefully adjusted in accordance with ...
Comments