Ensemble algorithms in reinforcement learning.
This paper describes several ensemble methods that combine multiple different reinforcement learning (RL) algorithms in a single agent. The aim is to enhance learning speed and final performance by combining the chosen actions or action probabilities of different RL algorithms. We designed and implemented four different ensemble methods combining the following five different RL algorithms: Q-learning, Sarsa, actor-critic (AC), QV-learning, and AC learning automaton. The intuitively designed ensemble methods, namely, majority voting (MV), rank voting, Boltzmann multiplication (BM), and Boltzmann addition, combine the policies derived from the value functions of the different RL algorithms, in contrast to previous work where ensemble methods have been used in RL for representing and learning a single value function. We show experiments on five maze problems of varying complexity; the first problem is simple, but the other four maze tasks are of a dynamic or partially observable nature. The results indicate that the BM and MV ensembles significantly outperform the single RL algorithms.
Wiering
Marco A
MA
Department of Artificial Intelligence, University of Groningen, 9400 AK Groningen, The Netherlands. mwiering@ai.rug.nl
van Hasselt
Hado
H
D000465:Algorithms; D003198:Computer Simulation; D005246:Feedback; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D011382:Programming, Linear; D012054:Reinforcement, Psychology; D013598:Systems Theory