Convergence analysis of online gradient method for BP neural networks ?
This paper considers a class of online gradient learning methods for backpropagation (BP) neural networks with a single hidden layer. We assume that in each training cycle, each sample in the training set is supplied in a stochastic order to the network exactly once. It is interesting that these stochastic learning methods can be shown to be deterministically convergent. This paper presents some weak and strong convergence results for the learning methods, indicating that the gradient of the error function goes to zero and the weight sequence goes to a fixed point, respectively. The conditions on the activation function and the learning rate to guarantee the convergence are relaxed compared with the existing results. Our convergence results are valid for not only SS type neural networks (both the output and hidden neurons are Sigmoid functions), but also for PP, PS and SP type neural networks, where S and P represent Sigmoid and polynomial functions, respectively.
online gradient method neural networks strong convergence backpropagation learning weak convergence