Genetic Algorithms in Noisy Environments

Genetic algorithms are adaptive search techniques which have been used to learn high-performance knowledge structures in reactive environments that provide information in the form of payoff. In general, payoff can be viewed as a noisy function of the structure being evaluated, and the learning task can be viewed as an optimization problem in a noisy environment. Previous studies have shown that genetic algorithms can perform effectively in the presence of noise. This work explores in detail the tradeoffs between the amount of effort spent on evaluating each structure and the number of structures evaluated during a given iteration of the genetic algorithm. Theoretical analysis shows that, in some cases, more efficient search results from less accurate evaluations. Further evidence is provided by a case study in which genetic algorithms are used to obtain good registrations of digital images.

[1]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[2]  Harvey F. Silverman,et al.  A Class of Algorithms for Fast Digital Image Registration , 1972, IEEE Transactions on Computers.

[3]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Martin Svedlow,et al.  Image Registration: Similarity Measure and Preprocessing Method Comparisons , 1978, IEEE Transactions on Aerospace and Electronic Systems.

[6]  F. James,et al.  Monte Carlo theory and practice , 1980 .

[7]  John Merchant.  Exact Area Registration Of Different Views Of A Common Object Scene , 1981 .

[8]  R.W. Ehrich,et al.  Computer image processing and recognition , 1981, Proceedings of the IEEE.

[9]  Stephen F. Smith,et al.  Flexible Learning of Problem Solving Heuristics Through Adaptive Search , 1983, IJCAI.

[10]  John J. Grefenstette,et al.  Genetic Search with Approximate Function Evaluation , 1985, ICGA.

[11]  Benny Lautrup,et al.  Monte Carlo methods in theoretical high-energy physics , 1985, CACM.

[12]  J. David Schaffer,et al.  Multi-Objective Learning via Genetic Algorithms , 1985, IJCAI.

[13]  John J. Grefenstette,et al.  A Technique For Automatic Motion Correction In DSA , 1986, Other Conferences.

[14]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[15]  John J. Grefenstette,et al.  Multilevel Credit Assignment in a Genetic Learning System , 1987, International Conference on Genetic Algorithms.

[16]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[17]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[18]  John H. Holland,et al.  Induction: Processes of Inference, Learning, and Discovery , 1987, IEEE Expert.

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[20]  Sam Kwong,et al.  Genetic algorithms and their applications , 1996, IEEE Signal Process. Mag..

[21]  Stewart W. Wilson.  Classifier Systems and the Animat Problem , 1987, Machine Learning.