Benchmarking for Bayesian Reinforcement Learning.
In the Bayesian Reinforcement Learning (BRL) setting, agents try to maximise the collected rewards while interacting with their environment while using some prior knowledge that is accessed beforehand. Many BRL algorithms have already been proposed, but the benchmarks used to compare them are only relevant for specific cases. The paper addresses this problem, and provides a new BRL comparison methodology along with the corresponding open source library. In this methodology, a comparison criterion that measures the performance of algorithms on large sets of Markov Decision Processes (MDPs) drawn from some probability distributions is defined. In order to enable the comparison of non-anytime algorithms, our methodology also includes a detailed analysis of the computation time requirement of each algorithm. Our library is released with all source code and documentation: it includes three test problems, each of which has two different prior distributions, and seven state-of-the-art RL algorithms. Finally, our library is illustrated by comparing all the available algorithms and the results are discussed.
Systems and Modeling, Montefiore Institute, University of Liege, Liege, Belgium.
Michael
http://orcid.org/0000-0002-1430-7092
M
Castronovo
Systems and Modeling, Montefiore Institute, University of Liege, Liege, Belgium.
Damien
D
Ernst
Systems and Modeling, Montefiore Institute, University of Liege, Liege, Belgium.
Adrien
A
Couëtoux
Systems and Modeling, Montefiore Institute, University of Liege, Liege, Belgium.
Raphael
R
Fonteneau
D000465:Algorithms; D000818:Animals; D001499:Bayes Theorem; D019985:Benchmarking / Q000379:methods*; D002755:Choice Behavior; D019295:Computational Biology / Q000379:methods; D003198:Computer Simulation; D003657:Decision Making; D006801:Humans; D007858:Learning / Q000502:physiology*; D008390:Markov Chains; D012054:Reinforcement, Psychology; D015203:Reproducibility of Results; D012201:Reward