Skip to main content

Does data-model co-evolution improve generalization performance of evolving learners?

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN V (PPSN 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1498))

Included in the following conference series:

  • 156 Accesses

Abstract

In co-evolution as defined by Hillis, data which defines a problem co-evolves simultaneously with a population of models searching for solutions. Herein, one way in which this could work is explored theoretically. Co-evolution could lead to improvement by evolving the data to a set which if a model is trained on it, it will generalize better than a model trained on the initial data. It is argued here that the data will not necessarily co-evolve to such a set in general. It is then shown in an extremely simple toy example that if there is too much optimization per generation, the system oscillates between very low fitness solutions, and will perform much worse than a system with no co-evolution. If the learning parameters are scaled appropriately, the data set does evolve to one which leads to better generalization performance. The improvement can be arbitrarily better in the large population size limit, but strong finite-population effects limit this, can be achieved.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hillis, W.D. Co-evolving Parasites Improve Simulated Evolution as an Optimization Procedure, Physica D 42, 228–234 (1990).

    Article  Google Scholar 

  2. Paredis, Jan, Coevolutionary Algorithms from the Handbook of Evolutionary Computation, Bäck, T. Fogel, D. Michalewicz Z. (eds.) Oxford University Press, 1997.

    Google Scholar 

  3. Paredis, Jan, Coevolving Cellular Automata: Beware of the Red Queen!, Proceedings of the Seventh Conference on Genetic Algorithms, Bäck, T. editor, 393–399, 1997.

    Google Scholar 

  4. Rattray,M Modelling the Dynamics of Genetic Algorithms Using Statistical Mechanics, University of Manchester Ph.D. thesis, 1996.

    Google Scholar 

  5. Rosin, C.D., Coevolutionary Search Among Adversaries, University of California Ph.D. thesis, 1997.

    Google Scholar 

  6. Valiant, L.G. A theory of the learnable, Communications of the ACM, 27 no. 11, 1134–1142, 1984.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Agoston E. Eiben Thomas Bäck Marc Schoenauer Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shapiro, J.L. (1998). Does data-model co-evolution improve generalization performance of evolving learners?. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056896

Download citation

  • DOI: https://doi.org/10.1007/BFb0056896

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65078-2

  • Online ISBN: 978-3-540-49672-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics