Abstract

A toy model of a neural network in which both Hebbian learning and reinforcement learning occur is studied. The problem of ‘path interference’, which makes that the neural net quickly forgets previously learned input–output relations is tackled by adding a Hebbian term (proportional to the learning rate ν) to the reinforcement term (proportional to δ) in the learning rule. It is shown that the number of learning steps is reduced considerably if 1/4< ν/ δ<1/2, i.e. if the Hebbian term is neither too small nor too large compared to the reinforcement term.

Full Text
Paper version not known

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 call

Disclaimer: 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.