Evolutionary design of application tailored neural networks

An evolutionary algorithm for designing single hidden-layer feedforward neural networks is proposed. The algorithm constructs a problem-tailored neural network by incremental introduction of new hidden units. Each new hidden unit is added to the network by linear partitioning of the hidden-layer representation through a genetic search. A two-stage algorithm speed-up is achieved through: (1) a distributed genetic search for hidden-layer unit construction, along with the appropriate input to hidden-layer weights; and (2) a 'dynamic pocket algorithm' for learning the hidden-to-output layer weights. Finally, promising experimental results are presented on the fast construction of small networks having good generalization properties.<<ETX>>

[1]  Peter E. Hart,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[2]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[3]  Darrell Whitley,et al.  Genetic cascade learning for neural networks , 1992, [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks.

[4]  Mitchell A. Potter,et al.  A genetic cascade-correlation learning algorithm , 1992, [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks.

[5]  Stephen I. Gallant,et al.  Perceptron-based learning algorithms , 1990, IEEE Trans. Neural Networks.

[6]  J. D. Schaffer,et al.  Combinations of genetic algorithms and neural networks: a survey of the state of the art , 1992, [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks.

[7]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[8]  Christian Lebiere,et al.  The Cascade-Correlation Learning Architecture , 1989, NIPS.