epsilon-optimality of a general class of learning algorithms

DOI10.1016/0020-0255(82)90029-9zbMath0509.68090OpenAlexW1983905907MaRDI QIDQ1838322

Yanyan Li

Publication date: 1982

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(82)90029-9

zbMATH Keywords

strongly absolutely expedient learning algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Mathematical psychology (91E99) Algorithms in computer science (68W99)

Related Items (2)

An Introduction to Learning Automata and Optimization ⋮ Absolutely expedient algorithms for learning Nash equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Absolute expediency of learning automata
• On a general class of absorbing-barrier learning algorithms
• Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service)
• The apparent conflict between estimation and control - a survey of the two-armed bandit problem
• On the linear model with two absorbing barriers
• Markov processes and learning models
• On the behavior of stochastic automata with a variable structure
• Bounds on the Convergence Probabilities of Learning Automata
• Two ε-Optimal Nonlinear Reinforcement Schemes for Stochastic Automata
• Learning Automata - A Survey
• Use of Stochastic Automata for Parameter Self-Optimization with Multimodal Performance Criteria
• Absolutely Expedient Learning Algorithms for Stochastic Automata

This page was built for publication: epsilon-optimality of a general class of learning algorithms