by Wojciech Jaśkowski, Krzysztof Krawiec

Abstract:

Problems in which some entities interact with each other are common in computational intelligence. This scenario, typical for co-evolving artificial-life agents, learning strategies for games, and machine learning from examples, can be formalized as test-based problem. In test-based problems, candidate solutions are evaluated on a number of test cases (agents, opponents, examples). It has been recently shown that at least some of such problems posses underlying problem structure, which can be formalized in a notion of coordinate system, which spatially arranges candidate solutions and tests in a multidimensional space. Such a coordinate system can be extracted to reveal underlying objectives of the problem, which can be then further exploited to help coevolutionary algorithm make progress. In this study, we propose a novel coevolutionary archive method, called Coordinate System Archive (COSA) that is based on these concepts. In the experimental part, we compare COSA to two state-of-the-art archive methods, IPCA and LAPCA. Using two different objective performance measures, we find out that COSA is superior to these methods on a class of artificial problems (compare-on-one).

Reference:

Coordinate System Archive for Coevolution (Wojciech Jaśkowski, Krzysztof Krawiec), In Evolutionary Computation (CEC), 2010 IEEE Congress on, 2010.

Bibtex Entry:

@InProceedings{Jaskowski2010coordinate, Title = {Coordinate System Archive for Coevolution}, Author = {Wojciech Jaśkowski and Krzysztof Krawiec}, Booktitle = {Evolutionary Computation (CEC), 2010 IEEE Congress on}, Year = {2010}, Address = {Barcelona}, Organization = {IEEE}, Pages = {1-10}, Abstract = {Problems in which some entities interact with each other are common in computational intelligence. This scenario, typical for co-evolving artificial-life agents, learning strategies for games, and machine learning from examples, can be formalized as test-based problem. In test-based problems, candidate solutions are evaluated on a number of test cases (agents, opponents, examples). It has been recently shown that at least some of such problems posses underlying problem structure, which can be formalized in a notion of coordinate system, which spatially arranges candidate solutions and tests in a multidimensional space. Such a coordinate system can be extracted to reveal underlying objectives of the problem, which can be then further exploited to help coevolutionary algorithm make progress. In this study, we propose a novel coevolutionary archive method, called Coordinate System Archive (COSA) that is based on these concepts. In the experimental part, we compare COSA to two state-of-the-art archive methods, IPCA and LAPCA. Using two different objective performance measures, we find out that COSA is superior to these methods on a class of artificial problems (compare-on-one).}, Doi = {10.1109/CEC.2010.5586066}, Keywords = {coordinate system, underlying problem structure, internal problem structure, test-based problem, coevolution, co-optimization, coevolutionary archive, compare-on-one, IPCA, LAPCA, COSA} }