Model-Based Active Exploration

Author name not available (Why is that?)

Publication date: 29 October 2018

Abstract: Efficient exploration is an unsolved problem in Reinforcement Learning which is usually addressed by reactively rewarding the agent for fortuitously encountering novel situations. This paper introduces an efficient active exploration algorithm, Model-Based Active eXploration (MAX), which uses an ensemble of forward models to plan to observe novel events. This is carried out by optimizing agent behaviour with respect to a measure of novelty derived from the Bayesian perspective of exploration, which is estimated using the disagreement between the futures predicted by the ensemble members. We show empirically that in semi-random discrete environments where directed exploration is critical to make progress, MAX is at least an order of magnitude more efficient than strong baselines. MAX scales to high-dimensional continuous environments where it builds task-agnostic models that can be used for any downstream task.

Has companion code repository: https://github.com/nnaisense/max

This page was built for publication: Model-Based Active Exploration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6308930)