Function induction, gene expression, and evolutionary representation construction

Different portions of the DNA, the primary information career of a living organism, are evaluated in different cells through the process of gene expression (DNA→mRNA→Protein). Such distributed evaluation of the fitness is possible only when its distributed representation using a set of basis functions is available in a living body. This paper argues that unless the evolution was provided with such a representation, we have every reason to believe that there must be an efficient mechanism to construct such a distributed representation. This paper considers functionally complete Walsh basis functions and shows that efficient polynomial-time computation of the Walsh representation (WR) is possible for problems with bounded non-linearity. It also offers a highly efficient algorithm O(2kr) to compute the WR for problems with non-negative Walsh coefficients, where r is the total number of non-zero terms in its WR.

[1]  Dirk Thierens.  Estimating the significant non-linearities in the genome problem-coding , 1999 .

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

[3]  James L. McClelland,et al.  Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

[4]  Melanie Mitchell,et al.  The Performance of Genetic Algorithms on Walsh Polynomials: Some Anomalous Results and Their Explanation , 1991, ICGA.

[5]  Fred Hoyle,et al.  Evolution from Space , 1982 .

[6]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..

[7]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..

[8]  Ryszard S. Michalski,et al.  A theory and methodology of inductive learning , 1993 .

[9]  B. Sankur,et al.  Applications of Walsh and related functions , 1986 .

[10]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[11]  L. Darrell Whitley,et al.  A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms , 1998, AAAI/IAAI.

[12]  Hillol Kargupta,et al.  A perspective on the foundation and evolution of the linkage learning genetic algorithms , 2000 .

[13]  Gunar E. Liepins,et al.  Polynomials, Basis Sets, and Deceptiveness in Genetic Algorithms , 1991, Complex Syst..

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Eyal Kushilevitz,et al.  Learning decision trees using the Fourier spectrum , 1991, STOC '91.

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

[17]  A. D. Bethke,et al.  Comparison of genetic algorithms and gradient-based optimizers on parallel processors : efficiency of use of processing capacity , 1976 .