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

Convergence of approximated gradient method for Elman network

Release Time:2019-03-10  Hits:

Indexed by: Journal Article

Date of Publication: 2008-01-01

Journal: NEURAL NETWORK WORLD

Included Journals: Scopus、EI、SCIE

Volume: 18

Issue: 3

Page Number: 171-180

ISSN: 1210-0552

Key Words: Elman network; approximated gradient method; convergence

Abstract: An approximated gradient method for training Elman networks is considered. For the finite sample set, the error function is proved to be monotone in the training process, and the approximated gradient of the error function tends to zero if the weights sequence is bounded. Furthermore, after adding a moderate condition, the weights sequence itself is also proved to be convergent. A numerical example is given to support the theoretical findings.

Prev One:Boundedness of a Batch Gradient Method with Penalty for Feedforward Nerual Networks

Next One:FINITE CONVERGENCE OF A FUZZY delta RULE FOR A FUZZY PERCEPTRON