The Hierarchical Discrete Learning Automaton Suitable for Environments with Many Actions and High Accuracy Requirements
Peer reviewed, Journal article
Accepted version
View/ Open
Date
2022Metadata
Show full item recordCollections
Original version
Omslandseter, R. O., Jiao, L., Zhang, X., Yazidi, A. & Oommen, J. (2022). The Hierarchical Discrete Learning Automaton Suitable for Environments with Many Actions and High Accuracy Requirements. Lecture Notes in Computer Science (LNCS), 13151, 507-518. https://doi.org/10.1007/978-3-030-97546-3_41Abstract
Since its early beginning, the paradigm of Learning Automata (LA), has attracted much interest. Over the last decades, new concepts and various improvements have been introduced to increase the LA’s speed and accuracy, including employing probability updating functions, discretizing the probability space, and implementing the “Pursuit” concept. The concept of incorporating “structure” into the ordering of the LA’s actions is one of the latest advancements to the field, leading to the ϵ-optimal Hierarchical Continuous Pursuit LA (HCPA) that has superior performance to other LA variants when the number of actions is large. Although the previously proposed HCPA is powerful, its speed has a handicap when the required action probability of an action is approaching unity. The reason for this slow convergence is that the learning parameter operates in a multiplicative manner within the probability space, making the increment of the action probability smaller as its probability becomes close to unity. Therefore, we propose the novel Hierarchical Discrete Learning Automata (HDPA) in this paper, which does not possess the same impediment as the HCPA. The proposed machine infuse the principle of discretization into the action probability vector’s updating functionality, where this type of updating is invoked recursively at every depth within a hierarchical tree structure and we pursue the best estimated action in all iterations through utilization of the Estimator phenomenon. The proposed machine is ϵ-optimal, and our experimental results demonstrate that the number of iterations required before convergence is significantly reduced for the HDPA, when compared with the HCPA.
Description
Author's accepted manuscript