Learning structured data from unspecific reinforcement
classification
❄️ cond-mat
keywords
datalearningreinforcementstructuredunspecificassociation-reinforcement-hebb-rulecasecope
read the original abstract
We show that a straightforward extension of a simple learning model based on the Hebb rule, the previously introduced Association-Reinforcement-Hebb-Rule, can cope with "delayed", unspecific reinforcement also in the case of structured data and lead to perfect generalization.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.