Q-Learning for Bandit Problems-Reference-Cited by-同舟云学术

Q-Learning for Bandit Problems

Published:1995 Issue: Volume: Page:209-217
ISSN:
Container-title:Machine Learning Proceedings 1995
language:
Short-container-title:

Author:

Duff Michael O.

Publisher

Elsevier

Reference25 articles.

1. “Learning and Sequential Decision Making”;Barto,1990

2. A. Barto, S. Bradtke, & S. Singh. (1991) “Real-Time Learning and Control Using Asynchronous Dynamic Programming.” Computer Science Department, University of Massachusetts, Tech. Rept. 91–57.

3. “Monte-Carlo Matrix Inversion and Reinforcement Learning”;Barto;Neural Information Processing Systems,1994

4. “A Problem in the Sequential Design of Experiments,”;Bellman;Sankhya,1956

5. Dynamic Programming: Deterministic and Stochastic Models;Bertsekas,1987

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tabular and Deep Learning for the Whittle Index;ACM Transactions on Modeling and Performance Evaluation of Computing Systems;2024-08-13

2. Exponential asymptotic optimality of Whittle index policy;Queueing Systems;2023-05-21

3. Quantum Reinforcement Learning for Multi-Armed Bandits;2022 41st Chinese Control Conference (CCC);2022-07-25

4. Collaborative Best Arm Identification in Multi-armed Bandits;2022 14th International Conference on COMmunication Systems & NETworkS (COMSNETS);2022-01-04

5. Neuroevolution vs Reinforcement Learning for Training Non Player Characters in Games: The Case of a Self Driving Car;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2021