Self-adaptation of mutation rates and dynamic fitness

  • Authors:
  • Matthew R. Glickman;Katia P. Sycara

  • Affiliations:
  • School of Computer Science, Carnegie Mellon University, Pittsburgh, PA;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA

  • Venue:
  • AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

In any search via artificial evolution, the likelihood of stagnation at local optima is determined by the particular choices of representation and search operators. Because the performance impact of these design choices is difficult to predict, it is an attractive option to let the representation and/or operators themselves evolve. However, effective evolution at this meta-level can be difficult to achieve for a number of reasons, including: (1) The complexity of the search space is increased; and (2) selection acts at the level of the fitness function and only indirectly at the meta-level, favoring variations only to the extent to which they are stochastically associated with fitness improvements. The question then becomes: Under what conditions is evolution of the representation and/or operators likely to be most effective?