资源论文Minimax-Regret Querying on Side Effects for Safe Optimality in Factored Markov Decision Processes

Minimax-Regret Querying on Side Effects for Safe Optimality in Factored Markov Decision Processes

2019-11-06 | |  52 |   47 |   0
Abstract As it achieves a goal on behalf of its human user, an autonomous agent’s actions may have side effects that change features of its environment in ways that negatively surprise its user. An agent that can be trusted to operate safely should thus only change features the user has explicitly permitted. We formalize this problem, and develop a planning algorithm that avoids potentially negative side effects given what the agent knows about (un)changeable features. Further, we formulate a provably minimax-regret querying strategy for the agent to selectively ask the user about features that it hasn’t explicitly been told about. We empirically show how much faster it is than a more exhaustive approach and how much better its queries are than those found by the best known heuristic.

上一篇:PEORL: Integrating Symbolic Planning and Hierarchical Reinforcement Learning for Robust Decision-Making

下一篇:Bayesian Active Edge Evaluation on Expensive Graphs

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...