The DOI matches its Crossref record.
Networks of Learning Automata
Abstract
1. Introduction.- 1.1 Machine Intelligence and Learning.- 1.2 Learning Automata.- 1.3 The Finite Action Learning Automaton (FALA).- 1.3.1 The Automaton.- 1.3.2 The Random Environment.- 1.3.3 Operation of FALA.- 1.4 Some Classical Learning Algorithms.- 1.4.1 Linear Reward-Inaction (LR?I) Algorithm.- 1.4.2 Other Linear Algorithms.- 1.4.3 Estimator Algorithms.- 1.4.4 Simulation Results.- 1.5 The Discretized Probability FALA.- 1.5.1 DLR?I Algorithm.- 1.5.2 Discretized Pursuit Algorithm.- 1.6 The Continuous Action Learning Automaton (CALA).- 1.6.1 Analysis of the Algorithm.- 1.6.2 Simulation Results.- 1.6.3 Another Continuous Action Automaton.- 1.7 The Generalized Learning Automaton (GLA).- 1.7.1 Learning Algorithm.- 1.7.2 An Example.- 1.8 The Parameterized Learning Automaton (PLA).- 1.8.1 Learning Algorithm.- 1.9 Multiautomata Systems.- 1.10 Supplementary Remarks.- 2. Games of Learning Automata.- 2.1 Introduction.- 2.2 A Multiple Payoff Stochastic Game of Automata.- 2.2.1 The Learning Algorithm.- 2.3 Analysis of the Automata Game Algorithm.- 2.3.1 Analysis of the Approximating ODE.- 2.4 Game with Common Payoff.- 2.5 Games of FALA.- 2.5.1 Common Payoff Games of FALA.- 2.5.2 Pursuit Algorithm for a Team of FALA.- 2.5.3 Other Types of Games.- 2.6 Common Payoff Games of CALA.- 2.6.1 Stochastic Approximation Algorithms and CALA.- 2.7 Applications.- 2.7.1 System Identification.- 2.7.2 Learning Conjunctive Concepts.- 2.8 Discussion.- 2.9 Supplementary Remarks.- 3. Feedforward Networks.- 3.1 Introduction.- 3.2 Networks of FALA.- 3.3 The Learning Model.- 3.3.1 G-Environment.- 3.3.2 The Network.- 3.3.3 Network Operation.- 3.4 The Learning Algorithm.- 3.5 Analysis.- 3.6 Extensions.- 3.6.1 Other Network Structures.- 3.6.2 Other Learning Algorithms.- 3.7 Convergence to the Global Maximum.- 3.7.1 The Network.- 3.7.2 The Global Learning Algorithm.- 3.7.3 Analysis of the Global Algorithm.- 3.8 Networks of GLA.- 3.9 Discussion.- 3.10 Supplementary Remarks.- 4. Learning Automata for Pattern Classification.- 4.1 Introduction.- 4.2 Pattern Recognition.- 4.3 Common Payoff Game of Automata for PR.- 4.3.1 Pattern Classification with FALA.- 4.3.2 Pattern Classification with CALA.- 4.3.3 Simulations.- 4.4 Automata Network for Pattern Recognition.- 4.4.1 Simulations.- 4.4.2 Network of Automata for Learning Global Maximum.- 4.5 Decision Tree Classifiers.- 4.5.1 Learning Decision Trees using GLA and CALA.- 4.5.2 Learning Piece-wise Linear Functions.- 4.6 Discussion.- 4.7 Supplementary Remarks.- 5. Parallel Operation of Learning Automata.- 5.1 Introduction.- 5.2 Parallel Operation of FALA.- 5.2.1 Analysis.- 5.2.2 ?-optimality.- 5.2.3 Speed of Convergence and Module Size.- 5.2.4 Simulation Studies.- 5.3 Parallel Operation of CALA.- 5.4 Parallel Pursuit Algorithm.- 5.4.1 Simulation Studies.- 5.5 General Procedure.- 5.6 Parallel Operation of Games of FALA.- 5.6.1 Analysis.- 5.6.2 Common Payoff Game.- 5.7 Parallel Operation of Networks of FALA.- 5.7.1 Analysis.- 5.7.2 Modules of Parameterized Learning Automata (PLA).- 5.7.3 Modules of Generalized Learning Automata (GLA).- 5.7.4 Pattern Classification Example.- 5.8 Discussion.- 5.9 Supplementary Remarks.- 6. Some Recent Applications.- 6.1 Introduction.- 6.2 Supervised Learning of Perceptual Organization in Computer Vision.- 6.3 Distributed Control of Broadcast Communication Networks.- 6.4O ther Applications.- 6.5 Discussion.- Epilogue.- Appendices.- A The ODE Approach to Analysis of Learning Algorithms.- A.I Introduction.- A.2 Derivation of the ODE Approximation.- A.2.1 Assumptions.- A.2.2 Analysis.- A.3 Approximating ODEs for Some Automata Algorithms.- A.3.2 The CALA Algorithm.- A.3.3 Automata Team Algorithms.- A.4 Relaxing the Assumptions.- B Proofs of Convergence for Pursuit Algorithm.- B.1 Proof of Theorem 1.1.- B.2 Proof of Theorem 5.7.- C Weak Convergence and SDE Approximations.- C.I Introduction.- C.2 Weak Convergence.- C.3 Convergence to SDE.- C.3.1 Application to Global Algorithms.- C.4 Convergence to ODE.- 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
Cited by
Classification in the Presence of Label Noise: A Survey
Frenay, B., & Verleysen, M. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2292894 · Cited by 1,777
Cognitive networks: adaptation and learning to achieve end-to-end performance objectives
Thomas, R., Friend, D., Dasilva, L., & Mackenzie, A. (2006) · IEEE Communications Magazine · doi:10.1109/mcom.2006.273099 · Cited by 467
Dynamic Computation Offloading for Mobile Cloud Computing: A Stochastic Game-Theoretic Approach
Zheng, J., Cai, Y., Wu, Y., & Shen, X. (2019) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2018.2847337 · Cited by 311
Thomas, R. W., DaSilva, L. A., & MacKenzie, A. B. (2005) · First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005. · doi:10.1109/dyspan.2005.1542652 · Cited by 262
Noise Tolerance Under Risk Minimization
Manwani, N., & Sastry, P. S. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2223460 · Cited by 258
Self-citation
Metadata
- Authors
- Thathachar, M. A. L., & Sastry, P. S.
- Publisher
- Springer US
- Published
- 2004
- OpenAlex
- W1574638321
- Cited by
- 324
- References
- 0
- FWCI
- 5.65
- 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: Networks of Learning Automata. https://app.cochat.ai/papers/10.1007/978-1-4419-9052-5
- The paper
- Thathachar, M. A. L., & Sastry, P. S. (2004). Networks of Learning Automata. https://doi.org/10.1007/978-1-4419-9052-5
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.