The Theory of Evolution Strategies [electronic resource] /
Evolutionary Algorithms, in particular Evolution Strategies, Genetic Algorithms, or Evolutionary Programming, have found wide acceptance as robust optimization algorithms in the last ten years. Compared with the broad propagation and the resulting practical prosperity in different scientific fields, the theory has not progressed as much. This monograph provides the framework and the first steps toward the theoretical analysis of Evolution Strategies (ES). The main emphasis is on understanding the functioning of these probabilistic optimization algorithms in real-valued search spaces by investigating the dynamical properties of some well-established ES algorithms. The book introduces the basic concepts of this analysis, such as progress rate, quality gain, and self-adaptation response, and describes how to calculate these quantities. Based on the analysis, functioning principles are derived, aiming at a qualitative understanding of why and how ES algorithms work.
Main Authors: | , |
---|---|
Format: | Texto biblioteca |
Language: | eng |
Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
2001
|
Subjects: | Computer science., Computer programming., Algorithms., Artificial intelligence., Bioinformatics., Computational biology., Statistical physics., Dynamical systems., Statistics., Computer Science., Artificial Intelligence (incl. Robotics)., Programming Techniques., Algorithm Analysis and Problem Complexity., Statistical Physics, Dynamical Systems and Complexity., Computer Appl. in Life Sciences., Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences., |
Online Access: | http://dx.doi.org/10.1007/978-3-662-04378-3 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
KOHA-OAI-TEST:200719 |
---|---|
record_format |
koha |
institution |
COLPOS |
collection |
Koha |
country |
México |
countrycode |
MX |
component |
Bibliográfico |
access |
En linea En linea |
databasecode |
cat-colpos |
tag |
biblioteca |
region |
America del Norte |
libraryname |
Departamento de documentación y biblioteca de COLPOS |
language |
eng |
topic |
Computer science. Computer programming. Algorithms. Artificial intelligence. Bioinformatics. Computational biology. Statistical physics. Dynamical systems. Statistics. Computer Science. Artificial Intelligence (incl. Robotics). Programming Techniques. Algorithm Analysis and Problem Complexity. Statistical Physics, Dynamical Systems and Complexity. Computer Appl. in Life Sciences. Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences. Computer science. Computer programming. Algorithms. Artificial intelligence. Bioinformatics. Computational biology. Statistical physics. Dynamical systems. Statistics. Computer Science. Artificial Intelligence (incl. Robotics). Programming Techniques. Algorithm Analysis and Problem Complexity. Statistical Physics, Dynamical Systems and Complexity. Computer Appl. in Life Sciences. Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences. |
spellingShingle |
Computer science. Computer programming. Algorithms. Artificial intelligence. Bioinformatics. Computational biology. Statistical physics. Dynamical systems. Statistics. Computer Science. Artificial Intelligence (incl. Robotics). Programming Techniques. Algorithm Analysis and Problem Complexity. Statistical Physics, Dynamical Systems and Complexity. Computer Appl. in Life Sciences. Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences. Computer science. Computer programming. Algorithms. Artificial intelligence. Bioinformatics. Computational biology. Statistical physics. Dynamical systems. Statistics. Computer Science. Artificial Intelligence (incl. Robotics). Programming Techniques. Algorithm Analysis and Problem Complexity. Statistical Physics, Dynamical Systems and Complexity. Computer Appl. in Life Sciences. Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences. Beyer, Hans-Georg. author. SpringerLink (Online service) The Theory of Evolution Strategies [electronic resource] / |
description |
Evolutionary Algorithms, in particular Evolution Strategies, Genetic Algorithms, or Evolutionary Programming, have found wide acceptance as robust optimization algorithms in the last ten years. Compared with the broad propagation and the resulting practical prosperity in different scientific fields, the theory has not progressed as much. This monograph provides the framework and the first steps toward the theoretical analysis of Evolution Strategies (ES). The main emphasis is on understanding the functioning of these probabilistic optimization algorithms in real-valued search spaces by investigating the dynamical properties of some well-established ES algorithms. The book introduces the basic concepts of this analysis, such as progress rate, quality gain, and self-adaptation response, and describes how to calculate these quantities. Based on the analysis, functioning principles are derived, aiming at a qualitative understanding of why and how ES algorithms work. |
format |
Texto |
topic_facet |
Computer science. Computer programming. Algorithms. Artificial intelligence. Bioinformatics. Computational biology. Statistical physics. Dynamical systems. Statistics. Computer Science. Artificial Intelligence (incl. Robotics). Programming Techniques. Algorithm Analysis and Problem Complexity. Statistical Physics, Dynamical Systems and Complexity. Computer Appl. in Life Sciences. Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences. |
author |
Beyer, Hans-Georg. author. SpringerLink (Online service) |
author_facet |
Beyer, Hans-Georg. author. SpringerLink (Online service) |
author_sort |
Beyer, Hans-Georg. author. |
title |
The Theory of Evolution Strategies [electronic resource] / |
title_short |
The Theory of Evolution Strategies [electronic resource] / |
title_full |
The Theory of Evolution Strategies [electronic resource] / |
title_fullStr |
The Theory of Evolution Strategies [electronic resource] / |
title_full_unstemmed |
The Theory of Evolution Strategies [electronic resource] / |
title_sort |
theory of evolution strategies [electronic resource] / |
publisher |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, |
publishDate |
2001 |
url |
http://dx.doi.org/10.1007/978-3-662-04378-3 |
work_keys_str_mv |
AT beyerhansgeorgauthor thetheoryofevolutionstrategieselectronicresource AT springerlinkonlineservice thetheoryofevolutionstrategieselectronicresource AT beyerhansgeorgauthor theoryofevolutionstrategieselectronicresource AT springerlinkonlineservice theoryofevolutionstrategieselectronicresource |
_version_ |
1756267465802776576 |
spelling |
KOHA-OAI-TEST:2007192018-07-30T23:27:49ZThe Theory of Evolution Strategies [electronic resource] / Beyer, Hans-Georg. author. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,2001.engEvolutionary Algorithms, in particular Evolution Strategies, Genetic Algorithms, or Evolutionary Programming, have found wide acceptance as robust optimization algorithms in the last ten years. Compared with the broad propagation and the resulting practical prosperity in different scientific fields, the theory has not progressed as much. This monograph provides the framework and the first steps toward the theoretical analysis of Evolution Strategies (ES). The main emphasis is on understanding the functioning of these probabilistic optimization algorithms in real-valued search spaces by investigating the dynamical properties of some well-established ES algorithms. The book introduces the basic concepts of this analysis, such as progress rate, quality gain, and self-adaptation response, and describes how to calculate these quantities. Based on the analysis, functioning principles are derived, aiming at a qualitative understanding of why and how ES algorithms work.1. Introduction -- 2. Concepts for the Analysis of the ES -- 3. The Progress Rate of the (1 % MathType!MTEF!2!1!+- % feaagCart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaaeaaaaaaaaa8 % qadaqadaWdaeaapeGaaGyma8aadaWfGaqaa8qacaGGSaaal8aabeqa % a8qacqGHRaWkaaGccqaH7oaBaiaawIcacaGLPaaaaaa!3C4E! $$\left( {1\mathop ,\limits^ + \lambda } \right)$$ ?)-ES on the Sphere Model -- 5. The Analysis of the (?, ?)-ES -- 6. The (?/?, ?) Strategies — or Why “Sex” May be Good -- 7. The (1, ?)-?-Self-Adaptation -- Appendices -- A. Integrals -- A.1 Definite Integrals of the Normal Distribution -- A.2 Indefinite Integrals of the Normal Distribution -- A.3 Some Integral Identities -- B. Approximations -- B.1 Frequently Used Taylor Expansions -- B.3 Cumulants, Moments, and Approximations -- B.3.1 Fundamental Relations -- B.3.2 The Weight Coefficients for the Density Approximation of a Standardized Random Variable -- B.4 Approximation of the Quantile Function -- C. The Normal Distribution -- C.3 Product Moments of Correlated Gaussian Mutations -- C.3.1 Fundamental Relations -- C.3.2 Derivation of the Product Moments -- D. (1, ?)-Progress Coefficients -- D.2 Table of Progress Coefficients of the (1, ?)-ES -- References.Evolutionary Algorithms, in particular Evolution Strategies, Genetic Algorithms, or Evolutionary Programming, have found wide acceptance as robust optimization algorithms in the last ten years. Compared with the broad propagation and the resulting practical prosperity in different scientific fields, the theory has not progressed as much. This monograph provides the framework and the first steps toward the theoretical analysis of Evolution Strategies (ES). The main emphasis is on understanding the functioning of these probabilistic optimization algorithms in real-valued search spaces by investigating the dynamical properties of some well-established ES algorithms. The book introduces the basic concepts of this analysis, such as progress rate, quality gain, and self-adaptation response, and describes how to calculate these quantities. Based on the analysis, functioning principles are derived, aiming at a qualitative understanding of why and how ES algorithms work.Computer science.Computer programming.Algorithms.Artificial intelligence.Bioinformatics.Computational biology.Statistical physics.Dynamical systems.Statistics.Computer Science.Artificial Intelligence (incl. Robotics).Programming Techniques.Algorithm Analysis and Problem Complexity.Statistical Physics, Dynamical Systems and Complexity.Computer Appl. in Life Sciences.Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences.Springer eBookshttp://dx.doi.org/10.1007/978-3-662-04378-3URN:ISBN:9783662043783 |