Balancing Samples' Contributions on GA Learning

A main branch in Evolutionary Computation is learning a system directly from input/output samples without investigating thternal behaviors of the system. Input/output samples captured from a real system are usually incomplete, biased and noisy. In order to evolve a precise system, the sample set should include a complete set of samples. Thus, a large number of samples should be used. Fitness functions being used in Evohitionary Algorithms usually based on the matched ratio of samples. Unfortunately, some of these samples may be exactly or semantically duplicated. These duplicated samples cannot be identified simply because we do not know the internal behavior of the system being evolved. This paper proposes a method to overcome this problem by using a dynamic fitness function that incorporates the contribution of each sample in the evolutionary process. Experiments on evolving Finite State Machines with Genetic Algorithms are presented to demonstrate the effect on improving the successful rate and convergent speed of the proposed method.

[1]  Prabhas Chongstitvatana,et al.  Synthesis of Synchronous Sequential Logic Circuits from Partial Input/Output Sequences , 1998, ICES.

[2]  Julio Tanomaru,et al.  Evolving Turing Machines from Examples , 1997, Artificial Evolution.

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

[4]  Prabhas Chongstitvatana,et al.  Improving correctness of finite-state machine synthesis from multiple partial input/output sequences , 1999, Proceedings of the First NASA/DoD Workshop on Evolvable Hardware.

[5]  Keshab K. Parhi.  High-speed Huffman decoder architectures , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.

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

[7]  Max L. Warshauer.  Conway's Parallel Sorting Algorithm , 1986, J. Algorithms.

[8]  Daniel Ashlock,et al.  A pure finite state baseline for Tartarus , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[9]  Shi-Yu Huang,et al.  A high-speed built-in-self-test design for DRAMs , 1999, 1999 International Symposium on VLSI Technology, Systems, and Applications. Proceedings of Technical Papers. (Cat. No.99TH8453).