期刊
NEUROCOMPUTING
卷 74, 期 5, 页码 765-770出版社
ELSEVIER
DOI: 10.1016/j.neucom.2010.10.005
关键词
Feedforward neural network; Online gradient method; Penalty; Momentum; Boundedness; Convergence
资金
- Foundation of China University of Petroleum [Y080820]
In this paper, the deterministic convergence of an online gradient method with penalty and momentum is investigated for training two-layer feedforward neural networks. The monotonicity of the new error function with the penalty term in the training iteration is firstly proved. Under this conclusion, we show that the weights are uniformly bounded during the training process and the algorithm is deterministically convergent. Sufficient conditions are also provided for both weak and strong convergence results. (C) 2010 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据