Proceedings

Non-decreasing Quantile Function Network with Efficient Exploration for Distributional Reinforcement Learning

Fan Zhou, Zhoufan Zhu, Qi Kuang, Liwen Zhang

Download BibTeX Cite

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. Main Track. Pages 3455-3461.

https://doi.org/10.24963/ijcai.2021/476

Keywords

  • Machine Learning: Deep Reinforcement Learning

Abstract

Although distributional reinforcement learning (DRL) has been widely examined in the past few years, there are two open questions people are still trying to address. One is how to ensure the validity of the learned quantile function, the other is how to efficiently utilize the distribution information. This paper attempts to provide some new perspectives to encourage the future in-depth studies in these two fields. We first propose a non-decreasing quantile function network (NDQFN) to guarantee the monotonicity of the obtained quantile estimates and then design a general exploration framework called distributional prediction error (DPE) for DRL which utilizes the entire distribution of the quantile function. In this paper, we not only discuss the theoretical necessity of our method but also show the performance gain it achieves in practice by comparing with some competitors on Atari 2600 Games especially in some hard-explored games.

Fan Zhou, Zhoufan Zhu, Qi Kuang, and Liwen Zhang. 2021. Non-decreasing Quantile Function Network with Efficient Exploration for Distributional Reinforcement Learning. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21. IJCAI, 3455–3461. https://doi.org/10.24963/ijcai.2021/476
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards