The success of Learning Automata (LA)-based estimator algorithms over the classical, Linear Reward-Inaction (L RI )-like schemes, can be explained by their ability to pursue the actions with the highest reward probability estimates. Without access to reward probability estimates, it makes sense for schemes like the L RI to first make large exploring steps, and then to gradually turn exploration into exploitation by making progressively smaller learning steps. However, this behavior becomes counter-intuitive when pursuing actions based on their estimated reward probabilities. Learning should then ideally proceed in progressively larger steps, as the reward probability estimates turn more accurate. This paper introduces a new estimator algorithm, the Discretized Bayesian Pursuit Algorithm (DBPA), that achieves this. The DBPA is implemented by linearly discretizing the action probability space of the Bayesian Pursuit Algorithm (BPA) [1]. The key innovation is that the linear discrete updating rules mitigate the counter-intuitive behavior of the corresponding linear continuous updating rules, by augmenting them with the reward probability estimates. Extensive experimental results show the superiority of DBPA over previous estimator algorithms. Indeed, the DBPA is probably the fastest reported LA to date.

Additional Metadata
Keywords Bayesian Reasoning, Discretized Learning, Estimator Algorithms, Learning Automata, Pursuit Schemes
Persistent URL
Series Lecture Notes in Computer Science
Zhang, X. (Xuan), Granmo, O.-C. (Ole-Christoffer), & Oommen, J. (2012). Discretized Bayesian pursuit - A new scheme for reinforcement learning. In Lecture Notes in Computer Science. doi:10.1007/978-3-642-31087-4_79