Pitfalls of learning a reward function online
On the map: Offline RL and imitation learning from data → Inverse reinforcement learning
Abstract (arXiv)
In some agent designs like inverse reinforcement learning an agent needs to learn its own reward function. Learning the reward function and optimising for it are typically two different processes, usually performed at different stages. We consider a continual (``one life'') learning approach where the agent both learns the reward function and optimises for it at the same time. We show that this comes with a number of pitfalls, such as deliberately manipulating the learning process in one direction, refusing to learn, ``learning'' facts already known to the agent, and making decisions that are strictly dominated (for all relevant reward functions). We formally introduce two desirable properties: the first is `unriggability', which prevents the agent from steering the learning process in the direction of a reward function that is easier to optimise. The second is `uninfluenceability', whereby the reward-function learning process operates by learning facts about the environment. We show that an uninfluenceable process is automatically unriggable, and if the set of possible environments is sufficiently rich, the converse is true too.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Inverse reinforcement learning, one of 13 directions in Offline RL and imitation learning from data. First posted on arXiv 28 Apr 2020.
Builds on
No reference list yet.
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2022Defining and Characterizing Reward Hacking
- 2025Reducing Reward Dependence in RL Through Adaptive Confidence Discounting
- 2021Identifiability in inverse reinforcement learning
- 2025Rethinking the Foundations for Continual Reinforcement Learning
- 2024Multi Task Inverse Reinforcement Learning for Common Sense Reward
- 2024Informativeness of Reward Functions in Reinforcement Learning
- 2024Reinforcement Learning with Lookahead Information
- 2024On the Limitations of Markovian Rewards to Express Multi-Objective, Risk-Sensitive, and Modal Tasks