location: Current position: Home >> Scientific Research >> Paper Publications

CONVERGENCE OF GRADIENT METHOD FOR DOUBLE PARALLEL FEEDFORWARD NEURAL NETWORK

Hits:

Indexed by:期刊论文

Date of Publication:2011-01-01

Journal:INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING

Included Journals:Scopus、SCIE

Volume:8

Issue:3

Page Number:484-495

ISSN No.:1705-5105

Key Words:Double parallel feedforward neural network; gradient method; monotonicity; convergence

Abstract:The deterministic convergence for a Double Parallel Feedforward Neural Network (DPFNN) is studied. DPFNN is a parallel connection of a multi-layer feedforward neural network and a single layer feedforward neural network. Gradient method is used for training DPFNN with finite training sample set. The monotonicity of the error function in the training iteration is proved. Then, some weak and strong convergence results are obtained, indicating that the gradient of the error function tends to zero and the weight sequence goes to a fixed point, respectively. Numerical examples are provided, which support our theoretical findings and demonstrate that DPFNN has faster convergence speed and better generalization capability than the common feedforward neural network.

Pre One:Binary Higher Order Neural Networks for Realizing Boolean Functions

Next One:CONVERGENCE OF SPLIT-COMPLEX BACKPROPAGATION ALGORITHM WITH A MOMENTUM