Abstract
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.
Article PDF
Similar content being viewed by others
References
Baker J. E. (1987). Reducing bias and inefficiency in the selection algorithm. Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms (pp. 14–21). Cambridge, MA: Lawrence Erlbaum.
Barnea D. I., & Silverman H. F. (1972). A class of algorithms for fast digital image registration. IEEE Transactions on Computers, 212, 179–186.
Davis L. (1987) (Ed.). Genetic algorithms and simulated annealing. London: Pitman Press.
De Jong, K. A. (1975). An analysis of the behavior of a class of genetic adaptive systems. Doctoral dissertation, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor.
Fitzpatrick J. M., & Leuze M. R. (1987). A class of injective two dimensional transformations. Computer Vision, Graphics, and Image Process, 39, 369–382.
Fitzpatrick J. M., Pickens D. R., Grefenstette J. J., Price R. R., & James A. E. (1987). A technique for automatic motion correction in DSA. Optical Engineering, 26, 1085–1093.
Fogel L. J., Owens A. J., & Walsh M. J. (1966). Artificial intelligence through simulated evolution. New York: John Wiley.
Goldberg D. E. (1985). Optimal initial population size for binary-coded geneti algorithms (TCGA Report No. 85001). Tuscaloosa: University of Alabama, The Clearinghouse for Genetic Algorithms.
Goldberg D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley.
Goshtasby, A. (1983). A symbolically-assisted approach to digital image registration with application in computer vision. Doctoral dissertation, Department of Computer Science, Michigan State University, East Lansing.
Grefenstette J. J. (1986). Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 16, 122–128.
Grefenstette J. J. (1987). Multilevel credit assignment in a genetic learning system. Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms (pp. 202–209). Cambridge, MA: Lawrence Erlbaum.
Grefenstette, J. J. (in press). Genetic algorithms and their applications. In A. Kent & J. G. Williams (Eds.), Encyclopedia of Computer Science and Technology (Vol. 21, Supplement 6). New York: Marcel Dekker, Inc.
Grefenstette J. J., & Fitzpatrick J. M. (1985). Genetic search with approximate function evaluations. Proceedings of the First International Conference on Genetic Algorithms and Their Applications (pp. 112–120). Pittsburgh, PA: Lawrence Erlbaum.
Hall E. L. (1979). Computer image processing and recognition. New York: Academic Press.
Holland J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press.
Holland J. H. (1980). Adaptive algorithms for discovering and using general patterns in growing knowledge-bases. International Journal of Policy Analysis and Information Systems, 4, 217–240.
Holland J. H., Holyoak K. J., Nisbett R. E., & Thagard P. R. (1986). Induction: Processes of inference, learning, and discovery. Cambridge, MA: MIT Press.
James F. (1980). Monte Carlo theory and practice. Reports on Progress in Physics, 43, 73.
Lautrup B. (1985). Monte Carlo methods in theoretical high-energy physics. Communications of the ACM, 28, 358–373.
Merchant J. (1981). Exact area registration of different views of a common object scene. Optical Engineering, 20, 424–436.
Schaffer J. D., & Grefenstette J. J. (1985). Multi-objective learning via genetic algorithms. Proceedings of the Ninth International Joint Conference on Artificial Intelligence (pp. 593–595). Los Angeles, CA: Morgan Kaufmann.
Smith S. F. (1983). Flexible learning of problem solving heuristics through adaptive search. Proceedings of the Eighth International Joint Conference on Artificial Intelligence (pp. 422–425). Karlsruhe, West Germany: Morgan Kaufmann.
Svedlow M., McGillem C. D., & Anuta P. F. (1978). Image registration: Similarity measure and preprocessing method comparisons. IEEE Transactions on Aerospace and Electronic Systems, 14, 141–150.
Venot A., & Leclerc V. (1984). IEEE Transactions on Medical Imaging, 3, 179–186.
Wilson S. W. (1987). Classifier systems and the animat problem. Machine Learning, 2, 199–228.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fitzpatrick, J.M., Grefenstette, J.J. Genetic algorithms in noisy environments. Mach Learn 3, 101–120 (1988). https://doi.org/10.1007/BF00113893
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00113893