The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Varieties of learning automata: an overview
Abstract
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper by Narendra and Thathachar (1974). Since then, there have been many fundamental advances in the theory as well as applications of these learning models. In the past few years, the structure of LA, has been modified in several directions to suit different applications. Concepts such as parameterized learning automata (PLA), generalized learning,automata (GLA), and continuous action-set learning automata (CALA) have been proposed, analyzed, and applied to solve many significant learning problems. Furthermore, groups of LA forming teams and feedforward networks have been shown to converge to desired solutions under appropriate learning algorithms. Modules of LA have been used for parallel operation with consequent increase in speed of convergence. All of these concepts and results are relatively new and are scattered in technical literature. An attempt has been made in this paper to bring together the main ideas involved in a unified framework and provide pointers to relevant references.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
An introduction to computing with neural nets
Lippmann, R. (1987) · IEEE ASSP Magazine · doi:10.1109/massp.1987.1165576 · Cited by 7,825
Adaptive Mixtures of Local Experts
Jacobs, R. A., Jordan, M. I., Nowlan, S. J., & Hinton, G. E. (1991) · Neural Computation · doi:10.1162/neco.1991.3.1.79 · Cited by 5,384
Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning
Williams, R. J. (1992) · Machine Learning · doi:10.1007/bf00992696 · Cited by 3,416
Learning Automata: An Introduction
Narendra, K. S., & Thathachar, M. A. L. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,540
Self-citationStochastic Approximation Algorithms and Applications
Puhalskii, A., Kushner, H. J., & Yin, G. G. (1998) · Journal of the American Statistical Association · doi:10.2307/2669885 · Cited by 994
Stochastic Approximation Algorithms and Applications
Kushner, H. J., & Yin, G. G. (1997) · Springer eBooks · doi:10.1007/978-1-4899-2696-8 · Cited by 869
Narendra, K. S., & Thathachar, M. A. L. (1974) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1974.5408453 · Cited by 668
Self-citationSastry, P. S., Phansalkar, V. V., & Thathachar, M. A. L. (1994) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.293490 · Cited by 320
Self-citation
Cited by
Evolutionary Dynamics of Multi-Agent Learning: A Survey
Bloembergen, D., Tuyls, K., Hennes, D., & Kaisers, M. (2015) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4818 · Cited by 295
Metadata
- Authors
- Thathachar, M. A. L., & Sastry, P. S.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
- Published
- 2002-12
- Volume
- 32
- Issue
- 6
- Pages
- 711-722
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2138914910
- Cited by
- 382
- References
- 24
- FWCI
- 5.69
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Varieties of learning automata: an overview. https://app.cochat.ai/papers/10.1109/tsmcb.2002.1049606
- The paper
- Thathachar, M. A. L., & Sastry, P. S. (2002). Varieties of learning automata: an overview. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics). https://doi.org/10.1109/tsmcb.2002.1049606
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.