Diverse Exploration for Fast and Safe Policy Improvement


  • Andrew Cohen Binghamton University
  • Lei Yu Binghamton University; Yantai University
  • Robert Wright Assured Information Security


Reinforcement Learning


We study an important yet under-addressed problem of quickly and safely improving policies in online reinforcement learning domains. As its solution, we propose a novel exploration strategy - diverse exploration (DE), which learns and deploys a diverse set of safe policies to explore the environment. We provide DE theory explaining why diversity in behavior policies enables effective exploration without sacrificing exploitation. Our empirical study shows that an online policy improvement algorithm framework implementing the DE strategy can achieve both fast policy improvement and safe online performance.




How to Cite

Cohen, A., Yu, L., & Wright, R. (2018). Diverse Exploration for Fast and Safe Policy Improvement. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/11758