A Modified Quickprop Algorithm · Authors · Affiliation. 1 Department of Computer Science, University of Waikato, New Zealand.
In this note we suggest a modification to the original algorithm which uses a problem independent means of restarting, requires only one major parameter (the.
Sep 1, 1991 · This content is only available as a PDF. Open the PDF for in another window. © 1991 Massachusetts Institute of Technology.
A Modified Quickprop Algorithm · Books · Conferences · Courses · Journals & Magazines · Standards · Recently Published · Popular.
People also ask
What is the quickprop algorithm used for?
What is modified algorithm?
This paper proposes a new fast learning algorithm modified from Quickprop that always converges with a faster learning rate compared with Quickprop.
A mathematical framework for the convergence analysis of the well-known Quickprop method is described. Furthermore, we propose a modification of this method ...
Simulations are conducted to compare and evaluate the performance of the new modified Quickprop algorithm with various popular training algorithms. The results ...
By addressing the drawbacks of the Quickprop algorithm, the new algorithm has a systematic approach to improve the convergence rate and the global convergence ...
Quickprop algorithm sometimes reduces computation time a hundreds times. 19 hundreds times. Quickprop algorithm by Fahlman (modified) (3). EBP Error Back ...
This paper proposes a new fast learning algorithm modified from Quickprop. By addressing the drawbacks of the Quickprop algorithm, the new algorithm has a ...