Referenced Items are not available for this document.
An algorithm for weight adjustments in a multilayer neural network is derived using the principles of dynamic programming. According to this algorithm at every layer the cost obtained using optimal values for weights for the remainder of the network is minimized using the weights in the current layer. Optimum weights are then computed recursively starting from the output layer. The mathematical formulation of the weight minimization problem is described within the dynamic programming framework. Equations governing weight adjustments in each layer are derived when the activation functions for neurons are continuous, e.g., sigmoid functions
Published in:
Neural Networks, 1991., IJCNN-91-Seattle International Joint Conference on
(Volume:i
)
Date of Conference: 8-14 Jul 1991
- Page(s):
- 397 - 402 vol.1
- Meeting Date :
- 08 Jul 1991-14 Jul 1991
- Print ISBN:
- 0-7803-0164-1
- INSPEC Accession Number:
- 4173855
- Conference Location :
- Seattle, WA
- Digital Object Identifier :
- 10.1109/IJCNN.1991.155210
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
