Abstract
A simple supervised learning algorithm for recurrent neural networks is proposed. It needs only O(n/sup 2/) memories and O(n/sup 2/) calculations, where n is the number of neurons, by limiting the problems to a delayed recognition (short-term memory) problem. Since O(n/sup 2/) is the same as the order of the number of connections in the neural network, it is suitable for implementation. This learning algorithm is similar to the conventional static backpropagation learning. Connection weights are modified by the products of the propagated error signal and some variables that hold the information about the past pre-synaptic neuron output.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
