Relationship Between Generalization and Diversity in Coevolutionary Learning

被引:30
作者
Chong, Siang Yew [1 ,2 ]
Tino, Peter [3 ]
Yao, Xin [3 ]
机构
[1] Univ Nottingham, Sch Comp Sci, Semenyih 43500, Malaysia
[2] Univ Nottingham, Sch Comp Sci, Automated Scheduling Optimisat & Planning ASAP Re, Nottingham NG8 1BB, England
[3] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England
基金
英国工程与自然科学研究理事会;
关键词
Coevolutionary learning; diversity maintenance; evolutionary computation (EC); generalization performance; iterated Prisoner's dilemma (IPD); EFFECTIVE CHOICE; NEURAL-NETWORKS; EVOLUTION; BEHAVIORS; ENSEMBLES; GAMES;
D O I
10.1109/TCIAIG.2009.2034269
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Games have long played an important role in the development and understanding of coevolutionary learning systems. In particular, the search process in coevolutionary learning is guided by strategic interactions between solutions in the population, which can be naturally framed as game playing. We study two important issues in coevolutionary learning-generalization performance and diversity-using games. The first one is concerned with the coevolutionary learning of strategies with high generalization performance, that is, strategies that can outperform against a large number of test strategies (opponents) that may not have been seen during coevolution. The second one is concerned with diversity levels in the population that may lead to the search of strategies with poor generalization performance. It is not known if there is a relationship between generalization and diversity in coevolutionary learning. This paper investigates whether there is such a relationship in coevolutionary learning through a detailed empirical study. We systematically investigate the impact of various diversity maintenance approaches on the generalization performance of coevolutionary learning quantitatively using case studies. The problem of the iterated prisoner's dilemma (IPD) game is considered. Unlike past studies, we can measure both the generalization performance and the diversity level of the population of evolved strategies. Results from our case studies show that the introduction and maintenance of diversity do not necessarily lead to the coevolutionary learning of strategies with high generalization performance. However, if individual strategies can be combined (e. g., using a gating mechanism), there is the potential of exploiting diversity in coevolutionary learning to improve generalization performance. Specifically, when the introduction and maintenance of diversity lead to a speciated population during coevolution, where each specialist strategy is capable of outperforming different opponents, the population as a whole can have a significantly higher generalization performance compared to individual strategies.
引用
收藏
页码:214 / 232
页数:19
相关论文
共 71 条
  • [61] New Methods for Competitive Coevolution
    Rosin, Christopher D.
    Belew, Richard K.
    [J]. EVOLUTIONARY COMPUTATION, 1997, 5 (01) : 1 - 29
  • [62] Runarsson T. P., 2005, IEEE T EVOLUT COMPUT, V9, P540
  • [63] Searching for Diverse, Cooperative Populations with Genetic Algorithms
    Smith, Robert E.
    Forrest, Stephanie
    Perelson, Alan S.
    [J]. EVOLUTIONARY COMPUTATION, 1993, 1 (02) : 127 - 149
  • [64] Competitive coevolution through evolutionary complexification
    Stanley, KO
    Miikkulainen, R
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2004, 21 : 63 - 100
  • [65] Ursem R. K., 2002, Parallel Problem Solving from Nature - PPSN VII. 7th International Conference. Proceedings (Lecture Notes in Computer Science Vol.2439), P462
  • [66] Watson R., 2001, P GENETIC EVOLUTIONA, P702
  • [67] Recent advances in evolutionary computation
    Yao, X
    Xu, Y
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (01) : 1 - 18
  • [68] Evolving artificial neural networks
    Yao, X
    [J]. PROCEEDINGS OF THE IEEE, 1999, 87 (09) : 1423 - 1447
  • [69] YAO X, 1999, P 1999 IEEE C SYST M, P575
  • [70] Yao X., 1994, INFORMATICA, V18, P375