Approximate Bayes Optimal Policy Search using Neural Networks

Michael Castronovo, Vincent François-Lavet, Raphaël Fonteneau, Damien Ernst, Adrien Couëtoux

Abstract

Bayesian Reinforcement Learning (BRL) agents aim to maximise the expected collected rewards obtained when interacting with an unknown Markov Decision Process (MDP) while using some prior knowledge. State-of-the-art BRL agents rely on frequent updates of the belief on the MDP, as new observations of the environment are made. This offers theoretical guarantees to converge to an optimum, but is computationally intractable, even on small-scale problems. In this paper, we present a method that circumvents this issue by training a parametric policy able to recommend an action directly from raw observations. Artificial Neural Networks (ANNs) are used to represent this policy, and are trained on the trajectories sampled from the prior. The trained model is then used online, and is able to act on the real MDP at a very low computational cost. Our new algorithm shows strong empirical performance, on a wide range of test problems, and is robust to inaccuracies of the prior distribution.

References

  1. Asmuth, J., Li, L., Littman, M., Nouri, A., and Wingate, D. (2009). A Bayesian sampling approach to exploration in Reinforcement Learning. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI), pages 19-26. AUAI Press.
  2. Asmuth, J. and Littman, M. (2011). Approaching Bayesoptimalilty using Monte-Carlo tree search. In Proceedings of the 21st International Conference on Automated Planning and Scheduling.
  3. Castro, P. S. and Precup, D. (2010). Smarter sampling in model-based bayesian reinforcement learning. In Machine Learning and Knowledge Discovery in Databases, pages 200-214. Springer.
  4. Castronovo, M., Ernst, D., Couetoux, A., and Fonteneau, R. (2015). Benchmarking for Bayesian Reinforcement Learning. Submitted.
  5. Castronovo, M., Fonteneau, R., and Ernst, D. (2014). Bayes Adaptive Reinforcement Learning versus Offline Prior-based Policy Search: an Empirical Comparison. 23rd annual machine learning conference of Belgium and the Netherlands (BENELEARN 2014), pages 1-9.
  6. Castronovo, M., Maes, F., Fonteneau, R., and Ernst, D. (2012). Learning exploration/exploitation strategies for single trajectory Reinforcement Learning. Journal of Machine Learning Research (JMLR), pages 1-9.
  7. Dearden, R., Friedman, N., and Russell, S. (1998). Bayesian Q-learning. In Proceedings of Fifteenth National Conference on Artificial Intelligence (AAAI), pages 761-768. AAAI Press.
  8. Duff, M. O. (2002). Optimal Learning: Computational procedures for Bayes-adaptive Markov decision processes. PhD thesis, University of Massachusetts Amherst.
  9. Fonteneau, R., Busoniu, L., and Munos, R. (2013). Optimistic planning for belief-augmented markov decision processes. In Adaptive Dynamic Programming And Reinforcement Learning (ADPRL), 2013 IEEE Symposium on, pages 77-84. IEEE.
  10. Guez, A., Silver, D., and Dayan, P. (2012). Efficient Bayesadaptive Reinforcement Learning using sample-based search. In Neural Information Processing Systems (NIPS).
  11. Guez, A., Silver, D., and Dayan, P. (2013). Scalable and efficient bayes-adaptive reinforcement learning based on monte-carlo tree search. Journal of Artificial Intelligence Research, pages 841-883.
  12. Kaelbling, L., Littman, M., and Cassandra, A. (1998). Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(12):99 - 134.
  13. Kearns, M., Mansour, Y., and Ng, A. Y. (2002). A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Machine Learning, 49(2- 3):193-208.
  14. Kocsis, L. and Szepesvári, C. (2006). Bandit based MonteCarlo planning. European Conference on Machine Learning (ECML), pages 282-293.
  15. Kolter, J. Z. and Ng, A. Y. (2009a). Near-Bayesian exploration in polynomial time. In Proceedings of the 26th Annual International Conference on Machine Learning.
  16. Kolter, J. Z. and Ng, A. Y. (2009b). Near-bayesian exploration in polynomial time. In Proceedings of the 26th Annual International Conference on Machine Learning, pages 513-520. ACM.
  17. Martin, J. J. (1967). Bayesian decision problems and markov chains. ”Originally submitted as a Ph.D. thesis [Massachusetts Institute of Technology, 1965]”.
  18. Schwenk, H. and Bengio, Y. (2000). Boosting Neural Networks. Neural Comp., 12(8):1869-1887.
  19. Silver, E. A. (1963). Markovian decision processes with uncertain transition probabilities or rewards. Technical report, DTIC Document.
  20. Sutton, R. S. and Barto, A. G. (1998). Reinforcement learning: An introduction, volume 1. MIT press Cambridge.
  21. Walsh, T. J., Goschin, S., and Littman, M. L. (2010). Integrating sample-based planning and model-based reinforcement learning. In AAAI.
  22. Wang, Y., Won, K. S., Hsu, D., and Lee, W. S. (2012). Monte carlo bayesian reinforcement learning. arXiv preprint arXiv:1206.6449.
  23. Zhang, T., Kahn, G., Levine, S., and Abbeel, P. (2015). Learning deep control policies for autonomous aerial
Download


Paper Citation


in Harvard Style

Castronovo M., François-Lavet V., Fonteneau R., Ernst D. and Couëtoux A. (2017). Approximate Bayes Optimal Policy Search using Neural Networks . In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-220-2, pages 142-153. DOI: 10.5220/0006191701420153


in Bibtex Style

@conference{icaart17,
author={Michael Castronovo and Vincent François-Lavet and Raphaël Fonteneau and Damien Ernst and Adrien Couëtoux},
title={Approximate Bayes Optimal Policy Search using Neural Networks},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2017},
pages={142-153},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006191701420153},
isbn={978-989-758-220-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Approximate Bayes Optimal Policy Search using Neural Networks
SN - 978-989-758-220-2
AU - Castronovo M.
AU - François-Lavet V.
AU - Fonteneau R.
AU - Ernst D.
AU - Couëtoux A.
PY - 2017
SP - 142
EP - 153
DO - 10.5220/0006191701420153