Abstract
Many adaptive neural network theories are based on neuronlike adaptive elements that can behave as single unit analogs of associative conditioning. In this article we develop a similar adaptive element, but one which is more closely in accord with the facts of animal learning theory than elements commonly studied in adaptive network research. We suggest that an essential feature of classical conditioning that has been largely overlooked by adaptive network theorists is its predictive nature. The adaptive element we present learns to increase its response rate in anticipation of increased stimulation, producing a conditioned response before the occurrence of the unconditioned stimulus. The element also is in strong agreement with the behavioral data regarding the effects of stimulus context, since it is a temporally refined extension of the Rescorla-Wagner model. We show by computer simulation that the element becomes sensitive to the most reliable, nonredundant, and earliest predictors of reinforcement . We also point out that the model solves many of the stability and saturation problems encountered in network simulations. Finally, we discuss our model in light of recent advances in the physiology and biochemistry of synaptic mechanisms.
Keywords
Related Publications
Method and theory in the study of avoidance.
Two-factor theories of avoidance were conceived to explain responding in avoidance procedures that closely resemble the Pavlovian paradigm in superficial features, although diff...
INFORMATION THEORY AND STIMULUS‐INDEPENDENT THOUGHT
The production of stimulus‐independent thought (e.g. fantasy and imagery) was measured as a function of the rate at which information was presented to human subjects. Informatio...
<i>The Brain's Default Network</i>
Thirty years of brain imaging research has converged to define the brain's default network—a novel and only recently appreciated brain system that participates in internal modes...
Neural computation by concentrating information in time.
An analog model neural network that can solve a general problem of recognizing patterns in a time-dependent signal is presented. The networks use a patterned set of delays to co...
Dropout Training of Matrix Factorization and Autoencoder for Link Prediction in Sparse Graphs
Matrix factorization (MF) and Autoencoder (AE) are among the most successful approaches of unsupervised learning. While MF based models have been extensively exploited in the gr...
Publication Info
- Year
- 1981
- Type
- article
- Volume
- 88
- Issue
- 2
- Pages
- 135-170
- Citations
- 1456
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1037/0033-295x.88.2.135