New globally convergent training scheme based on the resilient propagation algorithm

  • Authors:
  • Aristoklis D. Anastasiadis;George D. Magoulas;Michael N. Vrahatis

  • Affiliations:
  • School of Computer Science and Information Systems, Birkbeck College, University of London, Malet Street, London WC1E 7HX, UK;School of Computer Science and Information Systems, Birkbeck College, University of London, Malet Street, London WC1E 7HX, UK;Computational Intelligence Laboratory, Department of Mathematics, University of Patras Artificial Intelligence Research Center (UPAIRC), University of Patras, GR-26110 Patras, Greece

  • Venue:
  • Neurocomputing
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

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.