Avoiding Wireheading with Value Reinforcement Learning

By Tom Everitt, Marcus Hutter. 2016

51 citations recorded by the source corpus.

How can we design good goals for arbitrarily intelligent agents? Reinforcement learning (RL) may seem like a natural approach. Unfortunately, RL does not work well for generally intelligent agents, as RL agents are incentivised to shortcut the reward sensor for maximum reward – the so-called wireheading problem. In this paper we suggest an alternative to RL called value reinforcement learning (VRL). In VRL, agents use the reward signal to learn a utility function. The VRL setup allows us to remove the incentive to wirehead by placing a constraint on the agent’s actions. The constraint is defined in terms of the agent’s belief distributions, and does not require an explicit specification of which actions constitute wireheading.

Subfields: Reinforcement Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Reinforcement Learning

  1. Sergey Levine
  2. Tom Everitt
  3. Pieter Abbeel
  4. Shane Legg
  5. John Schulman
  6. Marcus Hutter
  7. Pedro A. Ortega
  8. Yuxi Li

Citations in the corpus