Genetic Algorithms and Adaptation
Genetics provides us with a canonical example of a complex search through a space of ill-defined possibilities. The basic problem is one of manipulating representations — the chromosomes — so as to search out and generate useful organization — the functional properties of the organism.
Even simple models of adaptation, based on (simplified) versions of reproduction, crossover and mutation, search the space of chromosomes in a way much more subtle than a “random search with preservation of the best.” In fact, the usual notion of evolution in terms of pools of alleles falls far short of describing what happens. Rather, the system acts as if it were continually testing a wide variety of combinations of alleles for use as components in the construction of new chromosomes. (In terms familiar to geneticists, the process is searching out coadapted sets of alleles. The alleles belonging to a given coadapted set may be distributed over the chromosome, and a given allele may belong to many distinct coadapted sets.) The overall effect is one of steadily biasing the generation of chromosomes toward incorporation of combinations (components) that have proved useful in similar contexts. It can be proved that this adaptive process, though dealing with a population (sample) of size M, usefully tests and exploits information about far in excess of M3 (M cubed) distinct combinations of alleles. For populations of any considerable size this number M3 is astronomically larger than the total number of alleles in the population. The corresponding speed-up in the search rate, a property called implicit parallelism, increases the adaptive potential tremendously. Moreover the implicit parallelism makes the process all but immune to some of the difficulties — particularly, high-dimensionality, discontinuity and false peaks — that attend complex ill-defined problems.
The laws of the models we have studied constitute a set of axioms that must at least be satisfied by any more sophisticated model involving more complicated versions of the genetic operators; as a consequence the basic properties of these models — the theorems — must hold in more sophisticated models that come closer to property of these more realistic models.
the ability to modify and develop decision and action sequences when payoff or feedback about performance occurs only after long sequences of context-dependent action;
the ability to generate a model for the environment based on the system’s experience, a model usable for lookahead and prediction.
KeywordsGenetic Algorithm Genetic Operator Random Search Sophisticated Model Genetic Process
Unable to display preview. Download preview PDF.
- Bethke, A. D. . “Genetic Algorithms as Function Optimizers.” University of Michigan Ph.D. Dissertation. Boden, M. A. [this volume]. Failure is not the spur.Google Scholar
- Buchanan, B. G. and Mitchell, T. M. . Model-directed learning of production rules, in: “Pattern-Directed Inference Systems,” D. A. Waterman and F. Hayes-Roth, eds., Academic Press, New York.Google Scholar
- Buchanan, B. G. [this volume].Google Scholar
- Davis, R. and King, J. . An overview of production systems, in; “Machine Intelligence 8,” E. W. Elcock and D. Michie, eds., Wiley, New York.Google Scholar
- De Jong, K. A. . Adaptive system design — a genetic approach, IEEE Trans. Systems, Man, and Cybernetics, 10:9.Google Scholar
- Eigen, M. and Winkler, R. . “Laws of the Game,” Knopf, New York.Google Scholar
- Holland, J. H. . “Adaptation in Natural and Artificial Systems,” University of Michigan Press, Ann Arbor.Google Scholar
- Holland, J. H. [1976a]. Studies of the spontaneous emergence of self-replicating systems using cellular automata and formal grammars, in: “Automata, Languages and Development,” A. Lindenmayer and G. Rozenberg, eds., North Holland, Amsterdam.Google Scholar
- Holland, J. H. [1976b]. Adaptation, “Progress in Theoretical Biology, 4,” R. Rosen and F. M. Snell, eds., Academic Press, New York.Google Scholar
- Holland, J. H. . Adaptive algorithms for discovering and using general patterns in growing knowledge bases. Int. J. Policy Analysis and Information Systems, 4:3.Google Scholar
- Holland, J. H. and Reitman, J. S. . Cognitive systems based on adaptive algorithms, “Pattern-Directed Inference Systems,” D. A. Waterman and F. Hayes-Roth, eds., Academic Press, New York.Google Scholar
- Lenat, D. B. . The Heuristics of Nature: The Plausible Mutation of DNA. Stanford University Computer Science Department Report HPP-80–27.Google Scholar
- Lewin, R. . Biggest challenge since the double helix. Science 212, April 3.Google Scholar
- McDermott, J. and Forgy, C. . Production system conflict resolution strategies, “Pattern-Directed Inference Systems,” D. A. Waterman and F. Hayes-Roth, eds., Academic Press, New York.Google Scholar
- Moorhead, P. S. and Kaplan, M. M. . “Mathematical Challenges in the Neo-Darwinian Interpretation of Evolution,” Wistar Institute Press, Philadelphia.Google Scholar
- Simon, H. A. . “The Sciences of the Artificial,” MIT Press, Cambridge.Google Scholar