%0 Conference Paper %1 Bengio:1994:GPslrNN %A Bengio, Samy %A Bengio, Yoshua %A Cloutier, Jocelyn %B Proceedings of the 1994 IEEE World Congress on Computational Intelligence %C Orlando, Florida, USA %D 1994 %I IEEE Press %K algorithms, genetic programming %P 324--327 %R doi:10.1109/ICEC.1994.349932 %T Use of genetic programming for the search of a new learning rule for neutral networks %U http://citeseer.ist.psu.edu/465154.html %V 1 %X In previous work (1, 2, 3) we explained how to use standard optimization methods such as simulated annealing, gradient descent and genetic algorithms to optimize a parametric function which could be used as a learning rule for neural networks. To use these methods, we had to choose a fixed number of parameters and a rigid form for the learning rule. In this article, we propose to use genetic programming to find not only the values of rule parameters but also the optimal number of parameters and the form of the rule. Experiments on classification tasks suggest genetic programming finds better learning rules than other optimization methods. Furthermore, the best rule found with genetic programming outperformed the well-known backpropagation algorithm for a given set of tasks

@inproceedings{Bengio:1994:GPslrNN, abstract = {In previous work ([1, 2, 3]) we explained how to use standard optimization methods such as simulated annealing, gradient descent and genetic algorithms to optimize a parametric function which could be used as a learning rule for neural networks. To use these methods, we had to choose a fixed number of parameters and a rigid form for the learning rule. In this article, we propose to use genetic programming to find not only the values of rule parameters but also the optimal number of parameters and the form of the rule. Experiments on classification tasks suggest genetic programming finds better learning rules than other optimization methods. Furthermore, the best rule found with genetic programming outperformed the well-known backpropagation algorithm for a given set of tasks}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Orlando, Florida, USA}, author = {Bengio, Samy and Bengio, Yoshua and Cloutier, Jocelyn}, biburl = {https://www.bibsonomy.org/bibtex/2d464395b9ff43eef7804afb4d6f920f5/brazovayeye}, booktitle = {Proceedings of the 1994 IEEE World Congress on Computational Intelligence}, doi = {doi:10.1109/ICEC.1994.349932}, interhash = {f6048d76e29fd06b16ba123d40caf559}, intrahash = {d464395b9ff43eef7804afb4d6f920f5}, keywords = {algorithms, genetic programming}, month = {27-29 June}, notes = {Uses GP to produce a learning rule for training a neural network. Evolved rule like back-propergation but better, differential is cubed. Says neural network is fully connected, IEEE Xplore link broken 16 Oct 2004}, pages = {324--327}, publisher = {IEEE Press}, size = {4 pages}, timestamp = {2008-06-19T17:36:24.000+0200}, title = {Use of genetic programming for the search of a new learning rule for neutral networks}, url = {http://citeseer.ist.psu.edu/465154.html}, volume = 1, year = 1994 }