Gaussian adaptation

From Conservapedia
This is an old revision of this page, as edited by Gregor (Talk | contribs) at 10:08, February 13, 2008. It may differ significantly from current revision.

Jump to: navigation, search

Gaussian adaptation is designed for the maximization of manufacturing yield due to statistical deviation of component values of signal processing systems. The process uses the theorem of Gaussian adaptation stating that: if the centre of gravity of a high-dimensional Gaussian distribution coincides with the centre of gravity of the part of the distribution belonging to some region of acceptability in a state of selective equilibrium, then the hitting probability on the region is maximal. The theorem is valid for all regions of acceptability and all Gaussian distributions. It may be used by cyclic repetition of random variation and selection (like the natural evolution). In every cycle a sufficiently large number of Gaussian distributed points are sampled and tested for membership in the region of acceptability. The centre of gravity of the Gaussian is then moved to the centre of gravity of the approved points. Thus, the process converges to a state of equilibrium fulfilling the theorem. A solution is always approximate because the centre of gravity is always determined for a limited number of points.

It was used for the first time in 1969 as a pure optimization algorithm making the regions of acceptability smaller and smaller. Since 1970 it has been used for both ordinary optimization and manufacturing yield maximization.


Gaussian adaptation as a model of evolution

It has also been compared to the natural evolution of populations of living organisms. In this case the region of acceptability is replaced by a probability function, s(x), where x is an array of phenotypes determining the organism. This is possible because the theorem of Gaussian adaptation is valid for any region of acceptability. Then it is fairly easily proved that the process is maximizing the mean fitness of a large population with respect to Gaussian distributed quantitative characters.

As long as the ontogenetic program my be seen as a stepwise modified recapitulation of the evolution of a particular individual organism, the central limit theorem states that the sum of contributions from many random steps tend to become Gaussian distributed. A necessary condition for the natural evolution to be able to fulfill the theorem of Gaussian adaptation is that it may push the centre of gravity of the Gaussian to the centre of gravity of the surviving individuals. The Hardy-Weinberg law may accomplish this.

In this case the rules of genetic variation such as crossover, inversion, transposition etcetera may be seen as random number generators for the phenotypes. So, in this sense GA may be seen as a genetic algorithm. --Gregor 05:08, 13 February 2008 (EST)

References

  • Bergström, R. M., 1969. An Entropy model of the Developing Brain. Developmental Psychobiology, 2(3): 139-152.
  • Bergström, M. Hjärnans resurser. Brain Books, ISBN 91-88410-07-2, Jönköping, 1992. (Swedish).
  • Bergström, M. Neuropedagogik. En skola för hela hjärnan. Wahlström & Widstrand, 1995. (Swedish).
  • Cramér, H. Mathematical Methods of Statistics. Princeton, Princeton University Press, 1961.
  • Dawkins, R. The Selfish Gene. Oxford University Press, 1976.
  • Eigen, M. Steps towards life. Oxford University Press, 1992.
  • Gaines, Brian R. Knowledge Management in Societies of Intelligent Adaptive Agents. Journal of intelligent Information systems 9, 277-298 (1997).
  • Goldberg, D. E. Genetic Algorithms in Search Optimization & Machine Learning. Addison-Wesley, New York, 1989.
  • Hamilton, WD. 1963. The evolution of altruistic behavior. American Naturalist 97:354-356
  • Hartl, D. L. A Primer of Population Genetics. Sinauer, Sunderland, Massachusetts, 1981.
  • Kandel, E. R., Schwartz, J. H., Jessel, T. M. Essentials of Neural Science and Behavior. Prentice Hall International, London, 1995.
  • Kjellström, G. Network Optimization by Random Variation of component values. Ericsson Technics, vol. 25, no. 3, pp. 133-151, 1969.
  • Kjellström, G. Optimization of electrical Networks with respect to Tolerance Costs. Ericsson Technics, no. 3, pp. 157-175, 1970.
  • Kjellström, G. & Taxén, L. Stochastic Optimization in System Design. IEEE Trans. on Circ. and Syst., vol. CAS-28, no. 7, July 1981.
  • Kjellström, G. On the Efficiency of Gaussian Adaptation. Journal of Optimization Theory and Applications, vol. 71, no. 3, Dec. 1991.
  • Kjellström, G. & Taxén, L. Gaussian Adaptation, an evolution-based efficient global optimizer; Computational and Applied Mathematics, In, C. Brezinski & U. * * Kulish (Editors), Elsevier Science Publishers B. V., pp 267-276, 1992.
  • Kjellström, G. Evolution as a statistical optimization algorithm. Evolutionary Theory 11:105-117 (January, 1996).
  • Kjellström, G. The evolution in the brain. Applied Mathematics and Computation, 98(2-3):293-300, February, 1999.
  • Kjellström, G. Evolution in a nutshell and some consequences concerning valuations. EVOLVE, ISBN 91-972936-1-X, Stockholm, 2002.
  • Levine, D. S. Introduction to Neural & Cognitive Modeling. Laurence Erlbaum Associates, Inc., Publishers, 1991.
  • MacLean, P. D. A Triune Concept of the Brain and Behavior. Toronto, Univ. Toronto Press, 1973.
  • Maynard Smith, J. 1964. Group Selection and Kin Selection, Nature 201:1145-1147.
  • Maynard Smith, J. 1998. Evolutionary Genetics. Oxford University Press.
  • Mayr, E. What Evolution is. Basic Books, New York, 2001.
  • Middleton, D. An Introduction to Statistical Communication Theory. McGraw-Hill, 1960.
  • Rechenberg, I. Evolutionsstrategie. Stuttgart: Fromann - Holzboog, 1973.
  • Reif, F. Fundmentals of Statistical and Thermal Physics. McGraw-Hill, 1985.
  • Ridley, M. Evolution. Blackwell Science, 1996.
  • Shannon, C. E. A Mathematical Theory of Communication, Bell Syst. Techn. J., Vol. 27, pp 379-423, (Part I), 1948.
  • Stehr, G. On the Performance Space Exploration of Analog Integrated Circuits. Technischen Universität Munchen, Dissertation 2005.
  • Taxén, L. A Framework for the Coordination of Complex Systems’ Development. Institute of Technology, Linköping University, 2003.
  • Zohar, D. The quantum self : a revolutionary view of human nature and consciousness rooted in the new physics. London, Bloomsbury, 1990
  • Åslund, N. The fundamental theorems of information theory (Swedish). Nordisk Matematisk Tidskrift, Band 9, Oslo 1961.

--Gregor 05:08, 13 February 2008 (EST)