Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9653571 | Neurocomputing | 2005 | 18 Pages |
Abstract
In this paper, a new globally convergent modification of the Resilient Propagation-Rprop algorithm is presented. This new addition to the Rprop family of methods builds on a mathematical framework for the convergence analysis that ensures that the adaptive local learning rates of the Rprop's schedule generate a descent search direction at each iteration. Simulation results in six problems of the PROBEN1 benchmark collection show that the globally convergent modification of the Rprop algorithm exhibits improved learning speed, and compares favorably against the original Rprop and the Improved Rprop, a recently proposed Rrpop modification.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Aristoklis D. Anastasiadis, George D. Magoulas, Michael N. Vrahatis,