Co-evolutionary learning on noisy tasks

The paper studies the effect of noise on co-evolutionary learning, using Backgammon as a typical noisy task. It might seem that co-evolutionary learning would be ill-suited to noisy tasks: genetic drift causes convergence to a population of similar individuals, and on noisy tasks it would seem to require many samples (i.e., many evaluations and long computation time) to discern small differences between similar population members. Surprisingly, the paper learns otherwise: for small population sizes, the number of evaluations does have an effect on learning; but for sufficiently large populations, more evaluations do not improve learning at all-population size is the dominant variable. This is because a large population maintains more diversity, so that the larger differences in ability can be discerned with a modest number of evaluations. This counter-intuitive result means that co-evolutionary learning is a feasible method for noisy tasks, such as military situations and investment management.

[1]  Risto Miikkulainen,et al.  Discovering Complex Othello Strategies through Evolutionary Neural Networks , 1995, Connect. Sci..

[2]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[3]  John Hallam,et al.  A hybrid GP/GA approach for co-evolving controllers and robot bodies to achieve fitness-specified tasks , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[4]  Richard K. Belew,et al.  Methods for Competitive Co-Evolution: Finding Opponents Worth Beating , 1995, ICGA.

[5]  W. Daniel Hillis,et al.  Co-evolving parasites improve simulated evolution as an optimization procedure , 1990 .

[6]  R. Palmer,et al.  Artificial economic life: a simple model of a stockmarket , 1994 .

[7]  Robert Axelrod,et al.  The Evolution of Strategies in the Iterated Prisoner's Dilemma , 2001 .

[8]  Xin Yao,et al.  Speciation as automatic categorical modularization , 1997, IEEE Trans. Evol. Comput..

[9]  Xin Yao,et al.  An Experimental Study of N-Person Iterated Prisoner's Dilemma Games , 1993, Informatica.

[10]  Jan Paredis,et al.  Co-evolutionary Constraint Satisfaction , 1994, PPSN.

[11]  SkjellumAnthony,et al.  A high-performance, portable implementation of the MPI message passing interface standard , 1996 .

[12]  Jordan B. Pollack,et al.  Co-Evolving Intertwined Spirals , 1996, Evolutionary Programming.

[13]  Gerald Tesauro,et al.  Practical Issues in Temporal Difference Learning , 1992, Mach. Learn..

[14]  David B. Fogel,et al.  Evolving Behaviors in the Iterated Prisoner's Dilemma , 1993, Evolutionary Computation.

[15]  Kristian Lindgren,et al.  Evolutionary phenomena in simple dynamics , 1992 .

[16]  Phil Husbands,et al.  Simulated Co-Evolution as the Mechanism for Emergent Planning and Scheduling , 1991, ICGA.

[17]  David M. Chess,et al.  Simulating the Evolution of Behavior: the Iterated Prisoners' Dilemma Problem , 1988, Complex Syst..

[18]  John J. Grefenstette,et al.  A Coevolutionary Approach to Learning Sequential Decision Rules , 1995, ICGA.

[19]  Takashi Ikegami,et al.  From genetic evolution to emergence of game strategies , 1994 .

[20]  Risto Miikkulainen,et al.  Discovering Complex Othello Strategies Through Evolutionary Neural Networks , 1995 .