On the Coevolutionary Construction of Learnable Gradients

“The best way for adaptive agents to learn is to be exposed to problems that are just a little more difficult than those they already know how to solve”. While this has been a guiding concept in developing algorithms for gradient construction in coevolution, it has remained largely an intuition rather than a formal concept. In this paper, we build on the ordertheoretic formulation of coevolution to develop some preliminary formal concepts towards clarifying the nature of the relation between the variational structure imposed by the representation and coevolutionary learning. By explicitly marrying the learnability problem to the variational structure of the learner space, we describe a basic idealization of how coevolution with an Ideal Teacher could inherently address the problem of appropriate gradient creation with the intent that this could serve as a basis to developing practical algorithmic mechanisms that approximate this idealized behavior.

[1]  Edwin D. de Jong,et al.  Automated Extraction of Problem Structure , 2004, GECCO.

[2]  Jordan B. Pollack,et al.  Pareto Optimality in Coevolutionary Learning , 2001, ECAL.

[3]  Stefano Nolfi,et al.  Competitive co-evolutionary robotics: from theory to practice , 1998 .

[4]  Jordan B. Pollack,et al.  Co-Evolution in the Successful Learning of Backgammon Strategy , 1998, Machine Learning.

[5]  Charles E. Taylor,et al.  Artificial Life II , 1991 .

[6]  Aude Billard,et al.  From Animals to Animats , 2004 .

[7]  Jordan B. Pollack,et al.  Methods for statistical inference: extending the evolutionary computation paradigm , 1999 .

[8]  Karl Sims,et al.  Evolving 3d morphology and behavior by competition , 1994 .

[9]  R. Watson,et al.  Pareto coevolution: using performance against coevolved opponents in a game as dimensions for Pareto selection , 2001 .

[10]  李幼升,et al.  Ph , 1989 .

[11]  Risto Miikkulainen,et al.  Competitive Coevolution through Evolutionary Complexification , 2011, J. Artif. Intell. Res..

[12]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[13]  Dave Cliff,et al.  Tracking the Red Queen: Measurements of Adaptive Progress in Co-Evolutionary Simulations , 1995, ECAL.

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

[15]  Edwin D. de Jong,et al.  Ideal Evaluation from Coevolution , 2004, Evolutionary Computation.

[16]  Susan L. Epstein Toward an Ideal Trainer , 1994 .

[17]  Richard K. Belew,et al.  Coevolutionary search among adversaries , 1997 .

[18]  Günter P. Wagner,et al.  Complex Adaptations and the Evolution of Evolvability , 2005 .

[19]  J. Pollack,et al.  Coevolutionary dynamics in a minimal substrate , 2001 .

[20]  F. Alajaji,et al.  c ○ Copyright by , 1998 .

[21]  Jordan B. Pollack,et al.  A Mathematical Framework for the Study of Coevolution , 2002, FOGA.