Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Xiong, Y.
Right arrow Articles by Zhang, C.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Xiong, Y.
Right arrow Articles by Zhang, C.
(Neural Computation. 2007;19:3356-3368.)
© 2007 The MIT Press


Letter

Training Pi-Sigma Network by Online Gradient Algorithm with Penalty for Small Weight Update

Yan Xiong

xiongyan888{at}sohu.com Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, People's Republic of China, and Faculty of Science, University of Science and Technology Liaoning, Anshan, 114051, People's Republic of China

Wei Wu

wuweiw{at}dlut.edu.cn Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, People's Republic of China

Xidai Kang

kxd_005{at}163.com Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, People's Republic of China

Chao Zhang

zhangchao_fox{at}163.com Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, People's Republic of China

A pi-sigma network is a class of feedforward neural networks with product units in the output layer. An online gradient algorithm is the simplest and most often used training method for feedforward neural networks. But there arises a problem when the online gradient algorithm is used for pi-sigma networks in that the update increment of the weights may become very small, especially early in training, resulting in a very slow convergence. To overcome this difficulty, we introduce an adaptive penalty term into the error function, so as to increase the magnitude of the update increment of the weights when it is too small. This strategy brings about faster convergence as shown by the numerical experiments carried out in this letter.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2007 by The MIT Press.