title: Computational properties and convergence analysis of BPNN for cyclic and almost cyclic learning with penalty.
abstract: Weight decay method as one of classical complexity regularization methods is simple and appears to work well in some applications for backpropagation neural networks (BPNN). This paper shows results for the weak and strong convergence for cyclic and almost cyclic learning BPNN with penalty term (CBP-P and ACBP-P). The convergence is guaranteed under certain relaxed conditions for activation functions, learning rate and under the assumption for the stationary set of error function. Furthermore, the boundedness of the weights in the training procedure is obtained in a simple and clear way. Numerical simulations are implemented to support our theoretical results and demonstrate that ACBP-P has better performance than CBP-P on both convergence speed and generalization ability.
authors.affiliation: School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, PR China.
authors.forename: Jian
authors.initials: J
authors.lastname: Wang
authors.forename: Wei
authors.initials: W
authors.lastname: Wu
authors.forename: Jacek M
authors.initials: JM
authors.lastname: Zurada
mesh_terms: D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D007858:Learning / Q000502:physiology; D016571:Neural Networks, Computer