%0 Conference Paper %1 icga93:zhang %A Zhang, Byoung-Tak %A Mühlenbein, Heinz %B Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93 %C University of Illinois at Urbana-Champaign %D 1993 %E Forrest, Stephanie %I Morgan Kaufmann %K algorithms, genetic programming %P 342--349 %T Genetic Programming of Minimal Neural Nets Using Occam's Razor %U http://www.ais.fraunhofer.de/~muehlen/publications/gmd_as_ga-93_04.ps %X A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each network is represented as a tree whose depth and width are dynamically adapted to the particular application by specifically defined genetic operators. The weights are trained by a next-ascent hillclimbing search. A new fitness function is proposed that quantifies the principle of Occam's razor. It makes an optimal trade-off between the error fitting ability and the parsimony of the network. We discuss the results for two problems of differing complexity and study the convergence and scaling properties of the algorithm.

@inproceedings{icga93:zhang, abstract = {A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each network is represented as a tree whose depth and width are dynamically adapted to the particular application by specifically defined genetic operators. The weights are trained by a next-ascent hillclimbing search. A new fitness function is proposed that quantifies the principle of Occam's razor. It makes an optimal trade-off between the error fitting ability and the parsimony of the network. We discuss the results for two problems of differing complexity and study the convergence and scaling properties of the algorithm.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {University of Illinois at Urbana-Champaign}, author = {Zhang, Byoung-Tak and M{\"u}hlenbein, Heinz}, biburl = {https://www.bibsonomy.org/bibtex/2f4def392b911e61046d705ddba75ba6e/brazovayeye}, booktitle = {Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93}, editor = {Forrest, Stephanie}, interhash = {f8871f8c26200da0d154832fc5832185}, intrahash = {f4def392b911e61046d705ddba75ba6e}, keywords = {algorithms, genetic programming}, month = {17-21 July}, notes = {GP feedforward binary ANN}, pages = {342--349}, publisher = {Morgan Kaufmann}, size = {8 pages}, timestamp = {2008-06-19T17:55:13.000+0200}, title = {Genetic Programming of Minimal Neural Nets Using {O}ccam's Razor}, url = {http://www.ais.fraunhofer.de/~muehlen/publications/gmd_as_ga-93_04.ps}, year = 1993 }