DocumentCode :
1929880
Title :
Certainty equivalence control with forcing: revisited
Author :
Agrawal, Rajeev ; Teneketzis, Demosthenis
Author_Institution :
Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA
fYear :
1989
fDate :
13-15 Dec 1989
Abstract :
Summary form only given, as follows. Stochastic adaptive optimization problems are considered with the objective of minimizing the rate of increase of the learning loss, i.e. the additional cost one has to pay due to the inbuilt learning tasks in such problems. In particular, an examination is made of two problems: the multiarmed bandit problem, and the adaptive control of Markov chains. Previous work has shown that the minimum rate of increase of the learning loss for these problems is typically O(log n). The schemes that achieve this minimum are quite complicated. The authors show that, with simple schemes of the certainty equivalence control with forcing type, one can come arbitrarily close to the optimal performance. Specifically, they construct a class of schemes so that, for any δ>0, they have a scheme whose learning loss is O((log n)1+δ)
Keywords :
Markov processes; adaptive control; game theory; learning systems; optimisation; stochastic systems; Markov chains; adaptive control; certainty equivalence control; forcing; game theory; learning loss; learning systems; multiarmed bandit problem; optimal performance; stochastic adaptive optimisation; stochastic systems; Control systems; Cost function; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 1989., Proceedings of the 28th IEEE Conference on
Conference_Location :
Tampa, FL
Type :
conf
DOI :
10.1109/CDC.1989.70538
Filename :
70538
Link To Document :
بازگشت