DECA: dimension extracting coevolutionary algorithm

Coevolution has often been based on averaged outcomes, resulting in unstable evaluation. Several theoretical approaches have used archives to provide stable evaluation. However, the number of tests required by some of these approaches can be prohibitive of practical applications. Recent work has shown the existence of a set of underlying objectives which compress evaluation information into a potentially small set of dimensions. We consider whether these underlying objectives can be approximated online, and used for evaluation in a coevolution algorithm. The Dimension Extracting Coevolutionary Algorithm (DECA) is compared to several recent reliable coevolution algorithms on a Numbers game problem, and found to perform efficiently. Application to the more realistic Tartarus problem is shown to be feasible. Implications for current coevolution research are discussed. Categories and Subject Descriptors F.0 [General] General Terms Algorithms, Experimentation, Performance Keywords Coevolut...

• Type: Conference
• Year: 2006
• Where: GECCO
• Authors: Edwin D. de Jong, Anthony Bucci
• Keywords: Coevolution, Coevolution Algorithms, GECCO 2006, Optimization, Reliable Coevolution Algorithms