Learning in genetic algorithms

  • Erol Gelenbe
Conference paper

DOI: 10.1007/BFb0057628

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1478)
Cite this paper as:
Gelenbe E. (1998) Learning in genetic algorithms. In: Sipper M., Mange D., Pérez-Uribe A. (eds) Evolvable Systems: From Biology to Hardware. ICES 1998. Lecture Notes in Computer Science, vol 1478. Springer, Berlin, Heidelberg

Abstract

Learning in artificial neural networks is often cast as the problem of “teaching” a set of stimulus-response (or input-output) pairs to an appropriate mathematical model which abstracts certain known properties of neural networks. A paradigm which has been developed independently of neural network models are genetic algorithms (GA). In this paper we introduce a mathematical framework concerning the manner in which genetic algorithms can learn, and show that gradient descent can be used in this frameork as well. In order to develop this theory, we use a class of stochastic genetic algorithms (GA) based on a population of chromosomes with mutation and crossover, as well as fitness, which we have described earlier in [18].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Erol Gelenbe
    • 1
  1. 1.Department of Electrical and Computer EngineeringDuke UniversityDurham

Personalised recommendations