In test-based problems, commonly approached with competitive coevolutionary algorithms, the fitness of a candidate solution is determined by the outcomes of its interactions with multiple tests. Usually, fitness is a scalar aggregate of interaction outcomes, and as such imposes a complete order on the candidate solutions. However, passing different tests may require unrelated `skills', and candidate solutions may vary with respect to such capabilities. In this paper, we provide theoretical evidence that scalar fitness, inherently incapable of capturing such differences, is likely to lead to premature convergence. To mitigate this problem, we propose disco, a method that automatically identifies the groups of tests for which the candidate solutions behave similarly and define the above skills. Each such group gives rise to a derived objective, which together guide the search algorithm in multi-objective fashion. When applied to several well-known test-based problems, the proposed approach significantly outperforms the conventional two-population coevolution. This opens the door to efficient and generic countermeasures to premature convergence for both coevolutionary and evolutionary algorithms applied to problems featuring aggregating fitness functions.
@ARTICLE { Liskowski:2016:EC,
ABSTRACT = { In test-based problems, commonly approached with competitive coevolutionary algorithms, the fitness of a candidate solution is determined by the outcomes of its interactions with multiple tests. Usually, fitness is a scalar aggregate of interaction outcomes, and as such imposes a complete order on the candidate solutions. However, passing different tests may require unrelated `skills', and candidate solutions may vary with respect to such capabilities. In this paper, we provide theoretical evidence that scalar fitness, inherently incapable of capturing such differences, is likely to lead to premature convergence. To mitigate this problem, we propose disco, a method that automatically identifies the groups of tests for which the candidate solutions behave similarly and define the above skills. Each such group gives rise to a derived objective, which together guide the search algorithm in multi-objective fashion. When applied to several well-known test-based problems, the proposed approach significantly outperforms the conventional two-population coevolution. This opens the door to efficient and generic countermeasures to premature convergence for both coevolutionary and evolutionary algorithms applied to problems featuring aggregating fitness functions. },
AUTHOR = { Pawe{\l} Liskowski and Krzysztof Krawiec },
DOI = { 10.1162/EVCO\_a\_00179 },
EPRINT = { http://dx.doi.org/10.1162/EVCO_a_00179 },
JOURNAL = { Evolutionary Computation },
KEYWORDS = { coevolution, test-based problems, multi-objective evolutionary computation },
NOTE = { PMID: 26953882 },
PAGES = { 375-406 },
TITLE = { Online Discovery of Search Objectives for Test-Based Problems },
URL = { http://dx.doi.org/10.1162/EVCO_a_00179 },
YEAR = { 2017 },
1 = { http://dx.doi.org/10.1162/EVCO_a_00179 },
2 = { http://dx.doi.org/10.1162/EVCO%5C_a%5C_00179 },
}