Absolutely Expedient Learning Algorithms for Stochastic Automata

DOI10.1109/TSMC.1973.4309220zbMath0258.94042OpenAlexW2289194510MaRDI QIDQ5675651

S. Lakshmivarahan, M. A. L. Thathachar

Publication date: 1973

Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsmc.1973.4309220

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)

Related Items (22)

Adaptive learning via selectionism and Bayesianism. I: Connection between the two ⋮ Stochastic learning-based weak estimation of multinomial random variables and its applications to pattern recognition in non-stationary environments ⋮ Learning automaton as a model to simulate and analyse learning behaviour in rats ⋮ Pioneering approaches for enhancing the speed of hierarchical LA by \textit{ordering} the actions ⋮ Absolute expediency of learning automata ⋮ Probabilistic automata ⋮ On a general class of absorbing-barrier learning algorithms ⋮ Learning behaviours of hierarchical structure stochastic automata operating in a non-stationary multi-teacher environment ⋮ Parameter optimization of stochastic automata operating in random environments ⋮ Theoretical considerations of the parameter self-optimization by stochastic automata ⋮ AN ESTIMATOR ALGORITHM FOR LEARNING AUTOMATA WITH CHANGING NUMBER OF ACTIONS ⋮ Stochastic automata and learning systems. ⋮ Parameter optimization of stochastic automata operating in random environments ⋮ An application of the stochastic automaton to the investment game ⋮ Combinatorial optimization by stochastic automata ⋮ General control systems ⋮ A cooperative game of a pair of learning automata ⋮ epsilon-optimality of a general class of learning algorithms ⋮ Reinforcement learning with internal expectation for the random neural network ⋮ On conditional optimality of a class of learning automata in random environments ⋮ Multiaction learning automata possessing ergodicity of the mean ⋮ Absolutely expedient algorithms for learning Nash equilibria

This page was built for publication: Absolutely Expedient Learning Algorithms for Stochastic Automata