M.R. Meybodi
Not Available
S. Hodjat
Not Available
ABSTRACT
This paper describes a general approach for automatically tuning of reinforcement learning algorithms` parameters. In this approach a reinforcement learning agents` parameters are tuned by other more simple algorithms of reinforcement learning. We will explain this approach by tuning one of the parameters of a Q-learning and statistical clustering algorithm. The results of tuning this parameter will be described by some simple examples. Comparing the result of an algorithm using automatically tuned parameter and the algorithms with fixed parameters will show that the former is generally more flexible and capable of performing better in most cases.
PDF References Citation
How to cite this article
M.R. Meybodi and S. Hodjat, 2002. Automatic Tuning of Q-learning Algorithms Parameters. Journal of Applied Sciences, 2: 408-415.
DOI: 10.3923/jas.2002.408.415
URL: https://scialert.net/abstract/?doi=jas.2002.408.415
DOI: 10.3923/jas.2002.408.415
URL: https://scialert.net/abstract/?doi=jas.2002.408.415
REFERENCES
- Kaelbling, L.P., M.L. Littman and A.W. Moore, 1996. Reinforcement learning: A survey. J. Artificial Intell. Res., 4: 237-285.
Direct Link - Krinskii, V.I., 1964. Asymptotically optimal automaton with exponential seed of convergence. Biofizica, 9: 484-487.
PubMedDirect Link - Mahadevan, S. and J. Connel, 1991. Automatic programming of behavior-based robots using reinforcement learning. Proceedings of the Artifical Intelligence, (AI`91), Pittsburgh, PA, pp: 311-365.
Direct Link