资源分类
》 资源 》论文》Cost-Sensitive Exploration in Bayesian Reinforcement Learning

Cost-Sensitive Exploration in Bayesian Reinforcement Learning

2020-01-16 | |  289 |   74 |   0

Abstract

In this paper, we consider Bayesian reinforcement learning (BRL) where actions incur costs in addition to rewards, and thus exploration has to be constrained in terms of the expected total cost while learning to maximize the expected longterm total reward. In order to formalize cost-sensitive exploration, we use the constrained Markov decision process (CMDP) as the model of the environment, in which we can naturally encode exploration requirements using the cost function. We extend BEETLE, a model-based BRL method, for learning in the environment with cost constraints. We demonstrate the cost-sensitive exploration behaviour in a number of simulated problems.

上一篇：Online Regret Bounds for Undiscounted Continuous Reinforcement Learning

下一篇：Exploration in Model-based Reinforcement Learning by Empirically Estimating Learning Progress

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...