Absolutely Expedient Learning Algorithms for Stochastic Automata
From MaRDI portal
Cited in
(22)- Multiaction learning automata possessing ergodicity of the mean
- Absolute expediency of learning automata
- Probabilistic automata
- On a general class of absorbing-barrier learning algorithms
- Absolutely expedient algorithms for learning Nash equilibria
- Reinforcement learning with internal expectation for the random neural network
- epsilon-optimality of a general class of learning algorithms
- Stochastic learning-based weak estimation of multinomial random variables and its applications to pattern recognition in non-stationary environments
- Adaptive learning via selectionism and Bayesianism. I: Connection between the two
- An estimator algorithm for learning automata with changing number of actions
- Learning automaton as a model to simulate and analyse learning behaviour in rats
- Learning behaviours of hierarchical structure stochastic automata operating in a non-stationary multi-teacher environment
- An application of the stochastic automaton to the investment game
- Parameter optimization of stochastic automata operating in random environments
- Theoretical considerations of the parameter self-optimization by stochastic automata
- Parameter optimization of stochastic automata operating in random environments
- Stochastic automata and learning systems.
- Pioneering approaches for enhancing the speed of hierarchical LA by \textit{ordering} the actions
- Combinatorial optimization by stochastic automata
- General control systems
- A cooperative game of a pair of learning automata
- On conditional optimality of a class of learning automata in random environments
This page was built for publication: Absolutely Expedient Learning Algorithms for Stochastic Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675651)
