Learning automata in feedforward connectionist systems

DOI10.1080/00207729608929198zbMATH Open0846.68089OpenAlexW2038949447MaRDI QIDQ4882341FDOQ4882341

Authors: V. V. Phansalkar, M. A. L. Thathachar 

Publication date: 12 September 1996

Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729608929198

Recommendations

• Pattern-recognizing stochastic learning automata
• Simple statistical gradient-following algorithms for connectionist reinforcement learning
• A new approach to the design of reinforcement schemes for learning automata
• scientific article; zbMATH DE number 4037208
• On conditional optimality of a class of learning automata in random environments

zbMATH Keywords

feedforward connectionist systemslearning automata algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Pattern-recognizing stochastic learning automata
• Title not available (Why is that?)
• Absolutely expedient algorithms for learning Nash equilibria

Cited In (4)

• Pattern-recognizing stochastic learning automata
• Recent advances in learning automata
• Analysis of associative reinforcement learning in neural networks using iterated function systems
• Use of learning automata in distributed fuzzy logic processor training

This page was built for publication: Learning automata in feedforward connectionist systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882341)