Abstract
Differential-geometric methods are applied to derive steady state conditions for the (μ/μ I ,λ)-ES on the general quadratic test function disturbed by fitness noise of constant strength. A new approach for estimating the expected final fitness deviation observed under such conditions is presented. The theoretical results obtained are compared with real ES runs, showing a surprisingly excellent agreement.
Similar content being viewed by others
References
D. V. Arnold, Noisy Optimization with Evolution Strategies. Kluwer Academic Publishers: Dordrecht, 2002.
D. V. Arnold and H.-G. Beyer, “Performance analysis of evolution strategies with multi-recombination in high-dimensional RN-search spaces disturbed by noise,” Theoretical Computer Science, vol. 289, pp. 629–647, 2002.
D. V. Arnold and H.-G. Beyer, “A comparison of evolution strategies with other direct search methods in the presence of noise,” Computational Optimization and Applications, vol. 24, pp. 135–159, 2003.
T. Bäck, U. Hammel, and H.-P Schwefel, “Evolutionary computation: Comments on the history and current state,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 3–17, 1997.
H.-G. Beyer, “Toward a theory of evolution strategies: Some asymptotical results from the (1,+λ)-theory,” Evolutionary Computation, vol. 1, no. 2, pp. 165–188, 1993.
H.-G. Beyer. “Evolutionary algorithms in noisy environments: Theoretical issues and guidelines for practice,” Computer Methods in Applied Mechanics and Engineering, vol. 186, no. 2–4, pp. 239–267, 2000.
H.-G. Beyer. The Theory of Evolution Strategies. Natural Computing Series. Springer: Heidelberg, 2001.
H.-G. Beyer and D. V. Arnold, “Fitness noise and localization errors of the optimum in general quadratic fitness models,” in GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference, W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith (Eds.), Morgan Kaufmann: San Francisco, CA, 1999, pp. 817–824.
H.-G. Beyer and D. V. Arnold, “The steady state behavior of (μ/μI, λ)-ES on ellipsoidal fitness models disturbed by noise,” in GECCO-2003: Proceedings of the Genetic and Evolutionary Computation Conference, E. Cantú-Paz et al. (Eds.), Springer: Berlin, Germany, 2003, pp. 525–536.
H.-G. Beyer and D. V Arnold, “Qualms regarding the optimality of cumulative path length control in CSA/CMA-evolution strategies,” Evolutionary Computation, vol. 11, no. 1, pp. 19–28, 2003.
H.-G. Beyer and K. Deb, “On self-adaptive features in real-parameter evolutionary algorithms,” IEEE Transactions on Evolutionary Computation, vol. 5, no. 3, pp. 250–270, 2001.
H.-G. Beyer, M. Olhofer, and B. Sendhoff, “On the behavior of (μ/μ I , λ)-ES optimizing functions disturbed by generalized noise,” in Foundations of Genetic Algorithms, K. De Jong, R. Poli, and J. Rowe, (Eds.), Morgan Kaufmann: San Francisco, CA, 2003, vol. 7, pp. 307–328.
J. Branke, Evolutionary Optimization in Dynamic Environments, Kluwer Academic Publishers: Dordrecht, 2001.
N. Hansen and A. Ostermeier, “Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation,” in Proceedings of 1996 IEEE Int’l Conf. on Evolutionary Computation (ICEC’96), IEEE Press: NY, 1996, pp. 312–317.
N. Hansen and A. Ostermeier, “Convergence properties of evolution strategies with the derandomized covariance matrix adaptation: The (μ/μ I , λ)-CMA-ES,” in 5th European Congress on Intelligent Techniques and Soft Computing (EUFIT’97), H.-J. Zimmermann (Ed.), Verlag Mainz: Aachen, Germany, 1997, pp. 650–654.
N. Hansen and A. Ostermeier, “Completely derandomized self-adaptation in evolution strategies,” Evolutionary Computation, vol. 9, no. 2, pp. 159–195, 2001.
A. Ostermeier, A. Gawelczyk, and N. Hansen, “A derandomized approach to self-adaptation of evolution strategies,” Evolutionary Computation, vol. 2, no. 4, pp. 369–380, 1995.
I. Rechenberg, Evolutionsstrategie ‘94, Frommann-Holzboog Verlag: Stuttgart, 1994.
H.-P. Schwefel, Numerical Optimization of Computer Models, Wiley: Chichester, 1981.
S. Tsutsui and A. Ghosh, “Genetic algorithms with a robust solution searching scheme,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 3, pp. 201–208, 1997.
D. Wiesmann, U. Hammel, and T. Bäck, “Robust design of multilayer optical coatings by means of evolutionary algorithms,” IEEE Transactions on Evolutionary Computation, vol. 2, no. 4, pp. 162–167, 1998.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Beyer, HG., Arnold, D.V. & Meyer-Nieberg, S. A New Approach for Predicting the Final Outcome of Evolution Strategy Optimization Under Noise. Genet Program Evolvable Mach 6, 7–24 (2005). https://doi.org/10.1007/s10710-005-7617-y
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10710-005-7617-y