Coevolutionary Principles

@inproceedings{Popovici2012CoevolutionaryP,
  title={Coevolutionary Principles},
  author={Elena Popovici and Anthony Bucci and R. Paul Wiegand and Edwin D. de Jong},
  booktitle={Handbook of Natural Computing},
  year={2012}
}
Coevolutionary algorithms approach problems for which no function for evaluating potential solutions is present or known. Instead, algorithms rely on the aggregation of outcomes from interactions among evolving entities in order to make selection decisions. Given the lack of an explicit yardstick, understanding the dynamics of coevolutionary algorithms, judging whether a given algorithm is progressing, and designing effective new algorithms present unique challenges unlike those faced by… Expand
Co-Evolution Versus Evolution with Random Sampling for Acquiring Othello Position Evaluation
TLDR
The results of extensive computational experiments prove that guiding coevolutionary search on the basis of games against a sample of random opponents employed by ICL has indeed a great potential when applied to the problem of Othello, and show that it is possible to design a coev evolutionary algorithm of better performance than ICL. Expand
Investigating coevolutionary algorithms For expensive fitness evaluations in cybersecurity
TLDR
This thesis devise coevolutionary algorithms and methods that achieve good results with fewer fitness evaluations, and present methods for selecting a solution to deploy after running experiments with multiple coev evolutionary algorithms. Expand
Improved Constructive Cooperative Coevolutionary Differential Evolution for Large-Scale Optimisation
TLDR
The Improved Constructive Cooperative Coevolutionary Differential Evolution (C3iDE) algorithm is proposed, which removes several limitations with the previous version and shows an improved solution quality on large-scale global optimisation problems compared to CCDE and DE. Expand
Novelty Search in Competitive Coevolution
TLDR
The results show that novelty-based approaches can evolve a significantly more diverse set of solutions, when compared to traditional fitness-based coevolution. Expand
Solving complex problems with coevolutionary algorithms
TLDR
His research investigates the utility of coevolutionary methods under non-stationary environments, and uses coev evolution to facilitate the discovery of agents for reinforcement learning tasks in games such as the Arcade Learning Environment, VizDoom and Dota 2. Expand
Conservation of Information in Coevolutionary Searches
A number of papers show that the No Free Lunch theorem does not apply to coevolutionary search. This has been interpreted as meaning that, unlike classical full query searches, coevolutionaryExpand
Novelty-Driven Cooperative Coevolution
TLDR
This study shows how novelty search can be used to avoid the counterproductive attraction to stable states in coevolution, and evaluates three novelty-based approaches that rely on the novelty of the team as a whole, the noveltyof the agents’ individual behaviour, and the combination of the two. Expand
Compensate information from multimodal dynamic landscapes: An anti-pathology cooperative coevolutionary algorithm
TLDR
A multipopulation strategy is proposed to simultaneously search local or global optima in each dynamic landscape and provide them to the other components and significantly improve the rate of converging to global optimum. Expand
Minimal criterion coevolution: a new approach to open-ended search
TLDR
This paper investigates the extent to which interactions between two coevolving populations, both subject to their own constraint, or minimal criterion, can produce results that are both functional and diverse even without any behavior characterization or novelty archive. Expand
Competitive coevolutionary algorithm decision support
Using coevolutionary algorithms to find solutions to problems is a powerful technique but once solutions are identified it can be difficult for a decision maker to select a solution to deploy.Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 122 REFERENCES
An analysis of two-population coevolutionary computation
TLDR
This dissertation is the first study that "glues" all four pieces together and provides a more holistic perspective of the field of CoEC by identifying a problem property and introducing tools for analyzing this property that are applicable across subareas. Expand
On identifying global optima in cooperative coevolution
TLDR
By modifying an existing CCEA to compare individuals using Pareto dominance, this work has produced an algorithm which reliably finds global optima and demonstrates the algorithm on two Maximum of Two Quadratics problems. Expand
Guaranteeing Coevolutionary Objective Measures
TLDR
This work presents a model of competitive fitness assessment with a single population and non-parametric selection, and shows minimum conditions and examples under which an objective measure exists, and when the dynamics of the coevolutionary algorithm are identical to those of a traditional EA. Expand
An Analysis of Cooperative Coevolutionary Algorithms A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy at George Mason University
AN ANALYSIS OF COOPERATIVE COEVOLUTIONARY ALGORITHMS R. Paul Wiegand George Mason University, 2003 Thesis Director: Dr. Kenneth A. De Jong Coevolutionary algorithms behave in very complicated, oftenExpand
Coevolutionary search among adversaries
Competitive coevolution is a biologically-inspired search technique that uses a genetic algorithm in two competing populations. During search, individuals in each population are evaluated by directExpand
DECA: dimension extracting coevolutionary algorithm
TLDR
The Dimension Extracting Coevolutionary Algorithm (DECA) is compared to several recent reliable coevolution algorithms on a Numbers game problem, and found to perform efficiently and application to the more realistic Tartarus problem is shown to be feasible. Expand
Order-theoretic Analysis of Coevolution Problems: Coevolutionary Statics
TLDR
A notion of solution for coevolution is defined which generalizes similar solution concepts in GA function optimization and MOO, and the ideal test set is defined, a potentially small set of tests which allow us to find the solution set of a problem. Expand
A Population-Differential Method of Monitoring Success and Failure in Coevolution
TLDR
A population-differential analysis based on an alternate "all-of-generation" (AOG) framework that is not similarly limited and provides useful insight into algorithmic dynamics of successful individuals is proposed. Expand
New Methods for Competitive Coevolution
TLDR
This work uses the games of Nim and 3-D Tic-Tac-Toe as test problems to explore three new techniques in competitive coevolution, which changes the way fitness is measured, shared sampling provides a method for selecting a strong, diverse set of parasites and the hall of fame encourages arms races by saving good individuals from prior generations. Expand
An empirical analysis of collaboration methods in cooperative coevolutionary algorithms
TLDR
This paper offers an empirical analysis of various types of collaboration mechanisms and presents some basic advice about how to choose a mechanism which is appropriate for a particular problem. Expand
...
1
2
3
4
5
...