DocumentCode
1563530
Title
Strong Convergence of Gradient Methods for BP Networks Training
Author
Wu, Wei ; Shao, Hongmei ; Di Qu
Author_Institution
Dept. of Appl. Math., Dalian Univ. of Technol.
Volume
1
fYear
2005
Firstpage
332
Lastpage
334
Abstract
Gradient method is a simple and popular learning algorithm for feedforward neural network (FNN) training. Some strong convergence results for both batch and online gradient methods are established based on existing weak convergence results. In particular, it is shown that for gradient-penalty algorithms, strong convergence results are immediate consequences of weak convergence results. For other batch and online gradient methods, the weak convergence plus the boundedness of the weights leads to the strong convergence. A class of gradient methods for general optimization problems is also considered, and some strong convergence results are obtained under mild conditions
Keywords
backpropagation; feedforward neural nets; gradient methods; optimisation; BP networks training; feedforward neural network training; general optimization problems; gradient-penalty algorithms; learning algorithm; Computer networks; Convergence; Electronic mail; Equations; Feedforward neural networks; Gradient methods; Mathematics; Neural networks; Optimization methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks and Brain, 2005. ICNN&B '05. International Conference on
Conference_Location
Beijing
Print_ISBN
0-7803-9422-4
Type
conf
DOI
10.1109/ICNNB.2005.1614626
Filename
1614626
Link To Document