loading...
Weight Groupings in the Training of Recurrent Networks
Como, Italy July 24-July 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IJCNN.2000.861275IEEE-INNS-ENNS International Joint Co ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lai-Wan Chan, Chinese University of Hong Kong
Chi-Cheong Szeto, Chinese University of Hong Kong
In this paper, we use the block-diagonal matrix to approximate the Hessian matrix in the Levenberg Marquardt method in the training of recurrent neural networks. Substantial improvement of the training time over the original Levenberg Marquardt method is observed without degrading the generalization ability. Three weight grouping methods, correlation blocks, k-unit blocks and layer blocks were investigated and compared. Their computational complexity, approximation ability, and training time are analyzed.
Citation:
Lai-Wan Chan, Chi-Cheong Szeto, "Weight Groupings in the Training of Recurrent Networks," ijcnn, vol. 3, pp.3021, IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 3, 2000
Usage of this product signifies your acceptance of the Terms of Use.