epsilon-optimality of a general class of learning algorithms
type: Item
instance of: scholarly article
title: epsilon-optimality of a general class of learning algorithms
zbMATH Open document ID: 0509.68090
DOI: 10.1016/0020-0255(82)90029-9
author: Yanyan Li
published in: Information Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 91E99
zbMATH DE Number: 3804896
zbMATH Keywords: strongly absolutely expedient learning algorithms
MaRDI profile type: Publication
full work available at URL: 0020-0255(82)90029-9
OpenAlex ID: W1983905907
cites work: Learning Automata - A Survey
cites work: Q4159331
cites work: Absolutely Expedient Learning Algorithms for Stochastic Automata
cites work: Bounds on the Convergence Probabilities of Learning Automata
cites work: Absolute expediency of learning automata
cites work: On a general class of absorbing-barrier learning algorithms
cites work: Two ε-Optimal Nonlinear Reinforcement Schemes for Stochastic Automata
cites work: Q5621113
cites work: On the behavior of stochastic automata with a variable structure
cites work: Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service)
cites work: On the linear model with two absorbing barriers
cites work: Markov processes and learning models
cites work: Q5590550
cites work: The apparent conflict between estimation and control - a survey of the two-armed bandit problem
cites work: Q3285075
cites work: Use of Stochastic Automata for Parameter Self-Optimization with Multimodal Performance Criteria
cites work: Q3926044
cites work: Q3332278
description: scientific article; zbMATH DE number 3804896