## Tutorial## An Easy Introduction to Theory of Evolutionary Computation## Benjamin Doerr (École Polytechnique)## TopicThe theory of evolutionary computation has always accompagnied the design and analysis of evolutionary algorithms. It has described their working principles, given advice on how to set their parameters, and has even proposed new algorithms. Due to their abstract nature, researcher from outside the theory domain often find it hard to understand and profit from these results. This tutorial addresses all CEC attendees who do not regularly use theoretical methods in their research and gives them a smooth introduction to the theory of evolutionary computation. Complementing other theory tutorials, we do not discuss mathematical methods or particular results, but explain - what the theory of evolutionary algorithms aims at,
- how theoretical research in evolutionary computation is conducted,
- how to interpret statements from the theory literature,
- what the most important theory contributions are, and
- what the current challenges are.
## Outline- Introduction: What is theory of evolutionary computation? What distinguishes theory from other research approaches?
- A guided walk through a famous theory result: Discussion of the linear functions result of Droste, Jansen, and Wegener and the work it inspired. A glimpse on the proof.
- How theory helps understanding and designing evolutionary algorithms: Detecting misbeliefs, suggesting parameters and operators, inspiring the development of new algorithms.
- How theory can help YOU! Theory-style thinking without formal proofs.
- Current hot topics: Dynamic parameter settting, estimation-of-distrition algorithms, noisy and dynamic optimization.
- Conclusion and outlook.
## Presenter
Together with Frank Neumann and Ingo Wegener, Benjamin Doerr founded the
theory track at GECCO and served as its co-chair 2007-2009 and 2014. He
is a member of the editorial boards of |