The DOI matches its Crossref record.
Pattern-recognizing stochastic learning automata
Abstract
A class of learning tasks is described that combines aspects of learning automation tasks and supervised learning pattern-classification tasks. These tasks are called associative reinforcement learning tasks. An algorithm is presented, called the associative reward-penalty, or AR-Palgorithm for which a form of optimal performance is proved. This algorithm simultaneously generalizes a class of stochastic learning automata and a class of supervised learning pattern-classification methods related to the Robbins-Monro stochastic approximation procedure. The relevance of this hybrid algorithm is discussed with respect to the collective behaviour of learning automata and the behaviour of networks of pattern-classifying adaptive elements. Simulation results are presented that illustrate the associative reinforcement learning task and the performance of the AR-Palgorithm as compared with that of several existing algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Predictive reward signal of dopamine neurons
Schultz, W. (1998) · Journal of Neurophysiology · doi:10.1152/jn.1998.80.1.1 · Cited by 4,564
Learning internal representations by error propagation
RUMELHART, D. E., HINTON, G. E., & WILLIAMS, R. J. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50035-2 · Cited by 3,002
Connectionist learning procedures
Hinton, G. E. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90049-0 · Cited by 1,430
Serial Order: A Parallel Distributed Processing Approach
Jordan, M. I. (1997) · Advances in Psychology · doi:10.1016/s0166-4115(97)80111-2 · Cited by 1,242
Dayan, P., Hinton, G. E., Neal, R. M., & Zemel, R. S. (1995) · Neural Computation · doi:10.1162/neco.1995.7.5.889 · Cited by 1,207
Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning
Williams, R. J. (1992) · Reinforcement Learning · doi:10.1007/978-1-4615-3618-5_2 · Cited by 903
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Haussler, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90010-d · Cited by 843
Simple statistical gradient-following algorithms for connectionist reinforcement learning
Williams, R. J. (1992) · Machine Learning · doi:10.1023/a:1022672621406 · Cited by 817
Gallant, S. I. (1988) · Communications of the ACM · doi:10.1145/42372.42377 · Cited by 660
Reinforcement learning is direct adaptive optimal control
(1992) · IEEE Control Systems · doi:10.1109/37.126844 · Cited by 524
Hinton, G. E. (1990) · Machine Learning · doi:10.1016/b978-0-08-051055-2.50029-8 · Cited by 516
Jacobs, R. A., Jordan, M. I., & Barto, A. G. (1991) · Cognitive Science · doi:10.1207/s15516709cog1502_2 · Cited by 490
Self-citationVarieties of learning automata: an overview
Thathachar, M. A. L., & Sastry, P. S. (2002) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2002.1049606 · Cited by 382
Reinforcement Learning Through Modulation of Spike-Timing-Dependent Synaptic Plasticity
Florian, R. V. (2007) · Neural Computation · doi:10.1162/neco.2007.19.6.1468 · Cited by 358
Multiagent reinforcement learning in the Iterated Prisoner's Dilemma
Sandholm, T. W., & Crites, R. H. (1996) · Biosystems · doi:10.1016/0303-2647(95)01551-5 · Cited by 332
Learning Without State-Estimation in Partially Observable Markovian Decision Processes
Singh, S. P., Jaakkola, T., & Jordan, M. I. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50042-8 · Cited by 327
A neuronal model of classical conditioning
Harry Klopf, A. (1988) · Psychobiology · doi:10.3758/bf03333113 · Cited by 318
Reinforcement structure/parameter learning for neural-network-based fuzzy logic control systems
Lin, C.-T., & Lee, C. S. G. (1994) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.273126 · Cited by 304
A stochastic reinforcement learning algorithm for learning real-valued functions
Gullapalli, V. (1990) · Neural Networks · doi:10.1016/0893-6080(90)90056-q · Cited by 295
Reinforcement learning can account for associative and perceptual learning on a visual-decision task
Law, C.-T., & Gold, J. I. (2009) · Nature Neuroscience · doi:10.1038/nn.2304 · Cited by 291
Function Optimization using Connectionist Reinforcement Learning Algorithms
WILLIAMS, R. J., & PENG, J. (1991) · Connection Science · doi:10.1080/09540099108946587 · Cited by 288
Local Synaptic Learning Rules Suffice to Maximize Mutual Information in a Linear Network
Linsker, R. (1992) · Neural Computation · doi:10.1162/neco.1992.4.5.691 · Cited by 280
Advances in fMRI Real-Time Neurofeedback
Watanabe, T., Sasaki, Y., Shibata, K., & Kawato, M. (2017) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2017.09.010 · Cited by 242
Attention-Gated Reinforcement Learning of Internal Representations for Classification
Roelfsema, P. R., & Ooyen, A. V. (2005) · Neural Computation · doi:10.1162/0899766054615699 · Cited by 260
Kawato, M., Maeda, Y., Uno, Y., & Suzuki, R. (1990) · Biological Cybernetics · doi:10.1007/bf00201442 · Cited by 256
Acquiring robot skills via reinforcement learning
(1994) · IEEE Control Systems · doi:10.1109/37.257890 · Cited by 206
Fiete, I. R., Fee, M. S., & Seung, H. S. (2007) · Journal of Neurophysiology · doi:10.1152/jn.01311.2006 · Cited by 167
Metadata
- Authors
- Barto, A. G., & Anandan, P.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1985-05
- Volume
- SMC-15
- Issue
- 3
- Pages
- 360-375
- ISSN
- 0018-9472 (ISSN-L)
- 2168-2909
- OpenAlex
- W2021801581
- Cited by
- 305
- References
- 0
- FWCI
- 5.12
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.