Distributional Reinforcement Learning with Unconstrained Monotonic Neural Networks
arXiv:2106.03228 · doi:10.1016/j.neucom.2023.02.049
Abstract
The distributional reinforcement learning (RL) approach advocates for representing the complete probability distribution of the random return instead of only modelling its expectation. A distributional RL algorithm may be characterised by two main components, namely the representation of the distribution together with its parameterisation and the probability metric defining the loss. The present research work considers the unconstrained monotonic neural network (UMNN) architecture, a universal approximator of continuous monotonic functions which is particularly well suited for modelling different representations of a distribution. This property enables the efficient decoupling of the effect of the function approximator class from that of the probability metric. The research paper firstly introduces a methodology for learning different representations of the random return distribution (PDF, CDF and QF). Secondly, a novel distributional RL algorithm named unconstrained monotonic deep Q-network (UMDQN) is presented. To the authors' knowledge, it is the first distributional RL method supporting the learning of three, valid and continuous representations of the random return distribution. Lastly, in light of this new algorithm, an empirical comparison is performed between three probability quasi-metrics, namely the Kullback-Leibler divergence, Cramer distance, and Wasserstein distance. The results highlight the main strengths and weaknesses associated with each probability metric together with an important limitation of the Wasserstein distance.
Research paper accepted for publication in the peer-reviewed Neurocomputing journal edited by Elsevier
References in corpus (9)
- A Distributional Perspective on Reinforcement Learning
- MinAtar: An Atari-Inspired Testbed for Thorough and Reproducible Reinforcement Learning Experiments
- Parametric Return Density Estimation for Reinforcement Learning
- Fully Parameterized Quantile Function for Distributional Reinforcement Learning
- Statistics and Samples in Distributional Reinforcement Learning
- Intra Order-preserving Functions for Calibration of Multi-Class Neural Networks
- Revisiting Rainbow: Promoting more Insightful and Inclusive Deep Reinforcement Learning Research
- Consistent and Flexible Selectivity Estimation for High-Dimensional Data
- Unconstrained Monotonic Neural Networks