| Alternate document: Details Genetic Programming Discovers Efficient Learning Rules for the Hidden and Output Layers of Feedforward Neural Networks (98) Amr Radi, |
Amr Radi, Riccardo Poli  Home/Search
Context Related
| cs.bham.ac.uk/pub/te...CSRP9803.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: liinwww.ira.uka...tion&maxnum=200 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The Standard BackPropagation (SBP) algorithm for training neural networks suffers from several problems. In this paper, a new technique based upon Genetic Programming (GP) is proposed to overcome some of these problems. We have used GP to discover new supervised learning algorithms. A new learning algorithms has been discovered and compared with SBP on different problems and has been shown to provide better performances. This study indicates that there exist many supervised learning... (Update)
Similar documents based on text: More All
1.3: Genetic Programming Discovers Efficient Learning Rules for the.. - Radi, Poli (1999) (Correct)
1.2: Evolutionary Discovery of Learning Rules for Feedforward Neural .. - Radi, Poli (1999) (Correct)
0.4: Discovery of Neural Network Learning Rules Using Genetic.. - Radi, Poli (1997) (Correct)
BibTeX entry: (Update)
A. Radi and R. Poli. Genetic programming can discover fast and general learning rules for neural networks. In Proceedings of the Third Annual on Genetic Programming Conference, pages 314--322, Jul. 1998. http://citeseer.ist.psu.edu/radi98genetic.html More
@inproceedings{ radi98genetic,
author = "Amr Radi and Riccardo Poli",
title = "Genetic Programming Can Discover Fast and General Learning Rules for Neural Networks",
booktitle = "Genetic Programming 1998: Proceedings of the Third Annual Conference",
month = "22-25",
publisher = "Morgan Kaufmann",
address = "University of Wisconsin, Madison, Wisconsin, USA",
editor = "John R. Koza and Wolfgang Banzhaf and Kumar Chellapilla and Kalyanmoy Deb and Marco Dorigo and David B. Fogel and Max H. Garzon and David E. Goldberg and Hitoshi Iba and Rick Riolo",
isbn = "1-55860-548-7",
pages = "314--323",
year = "1998",
url = "citeseer.ist.psu.edu/radi98genetic.html" }
Citations (may not include all citations):1931 Adaptation in Natural and Artificial Systems (context) - Holland - 1975
1053 Genetic Programming: on the programming of computers by mean.. (context) - Koza - 1992
550 Parallel Distributed Processing (context) - Rumelhart, Hinton et al. - 1986
132 An empirical study of learning speed in back propagation net.. - Fahlman - 1988
56 Back propagation algorithm which varies the number of hidden.. (context) - Hirose, Yamashit et al. - 1991
54 The evolution of learning: An experiment in genetic connecti.. - Chalmers - 1990
44 Optimizing neural networks using faster (context) - Whitley, Hanson - 1989
32 An overview of evolutionary computation - William, De Jong et al. - 1993
27 Advanced supervised learning in multi-layer perceptrons from.. - Riedmiller - 1994
26 Speed up learning and network optimization with extended bac.. - Sperduti, Starita - 1993
24 Neurogenetic learning: an integrated method of designing and.. (context) - Kitano - 1994
15 A scaled conjugate gradient algorithm for fast supervised le.. - Moller - 1993
14 Benefits of gain: Speeded learning and minimal hidden layers.. - Kruschke, Movellan - 1991
12 Use of genetic programming for the search of a learning rule.. (context) - Bengio, Bengio et al. - 1994
10 Macmillan College Publishing (context) - Haykin, Foundation et al. - 1994
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://liinwww.ira.uka.de/searchbib/index?query=PoliR&partial=on&case=on&results=citation&maxnum=200): More
Schema Theory without Expectations for GP and GAs with One-Point.. - Poli (1999) (Correct)
On Fitness Proportionate Selection and the Schema Theorem in the.. - Poli (2000) (Correct)
A Macroscopic Exact Schema Theorem and a Redefinition of Effective .. - Poli (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC