Runtime Analysis of Competitive co-Evolutionary Algorithms for Maximin Optimisation of a Bilinear Function
Author:
Preprint
Abstract
Co-evolutionary algorithms have a wide range of applications, such as in hardware design, evolution of strategies for board games, and patching software bugs. However, these algorithms are poorly understood and applications are often limited by pathological behaviour, such as loss of gradient, relative over-generalisation, and mediocre objective stasis. It is an open challenge to develop a theory that can predict when co-evolutionary algorithms find solutions efficiently and reliable. This paper provides a first step in developing runtime analysis for population-based competitive co-evolutionary algorithms. We provide a mathematical framework for describing and reasoning about the performance of co-evolutionary processes. An example application of the framework shows a scenario where a simple co-evolutionary algorithm obtains a solution in polynomial expected time. Finally, we describe settings where the co-evolutionary algorithm needs exponential time with overwhelmingly high probability to obtain a solution.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Adversarial genetic programming for cyber security: a rising application domain where GP mattersGenetic Programming and Evolvable Machines, 2020
- On the application of Danskin’s theorem to derivative-free minimax problemsAIP Conference Proceedings, 2019
- Level-Based Analysis of Genetic Algorithms and Other Search ProcessesIEEE Transactions on Evolutionary Computation, 2017
- Finding Approximate Nash Equilibria of Bimatrix Games via Payoff QueriesACM Transactions on Economics and Computation, 2016
- Error Thresholds in Genetic AlgorithmsEvolutionary Computation, 2006
- The Cooperative Coevolutionary (1+1) EAEvolutionary Computation, 2004
- Cooperative Coevolution: An Architecture for Evolving Coadapted SubcomponentsEvolutionary Computation, 2000
- Co-evolving parasites improve simulated evolution as an optimization procedurePhysica D: Nonlinear Phenomena, 1990