Deep autoregressive density nets vs neural ensembles for model-based offline reinforcement learning
Abdelhakim Benechehab, Albert Thomas, Balázs Kégl
TL;DR
This paper tackles offline reinforcement learning by challenging the common reliance on ensembles for uncertainty in model-based methods. It proposes a single, well-calibrated autoregressive dynamics model (DARMDN) and shows that it can outperform neural ensembles on static learning metrics and yield strong dynamic performance in Hopper/D4RL tasks. By decoupling model selection from agent training, the study isolates model quality and demonstrates that one-step calibration metrics (LR and KS) robustly predict downstream policy performance, even when long-horizon metrics decline due to error accumulation. The results highlight the practical value of calibrated uncertainty in conservative offline MBRL and motivate broader validation and a unified evaluation protocol for offline RL.
Abstract
We consider the problem of offline reinforcement learning where only a set of system transitions is made available for policy optimization. Following recent advances in the field, we consider a model-based reinforcement learning algorithm that infers the system dynamics from the available data and performs policy optimization on imaginary model rollouts. This approach is vulnerable to exploiting model errors which can lead to catastrophic failures on the real system. The standard solution is to rely on ensembles for uncertainty heuristics and to avoid exploiting the model where it is too uncertain. We challenge the popular belief that we must resort to ensembles by showing that better performance can be obtained with a single well-calibrated autoregressive model on the D4RL benchmark. We also analyze static metrics of model-learning and conclude on the important model properties for the final performance of the agent.
