mlsanityData to 14 Oct 2026

Formalizing the Problem of Side Effect Regularization

arXiv 2206.11812 ↗First posted 23 Jun 2022cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

AI objectives are often hard to specify properly. Some approaches tackle this problem by regularizing the AI's side effects: Agents must weigh off "how much of a mess they make" with an imperfectly specified proxy objective. We propose a formal criterion for side effect regularization via the assistance game framework. In these games, the agent solves a partially observable Markov decision process (POMDP) representing its uncertainty about the objective function it should optimize. We consider the setting where the true objective is revealed to the agent at a later time step. We show that this POMDP is solved by trading off the proxy reward with the agent's ability to achieve a range of future tasks. We empirically demonstrate the reasonableness of our problem formalization via ground-truth evaluation in two gridworld environments.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 11 of its 23 references that are in the map. First posted on arXiv 23 Jun 2022.

Builds on

11 of 23 references.

References · 11

  1. 2017Constrained Policy Optimizationcited by 983
  2. 2016Cooperative Inverse Reinforcement Learningcited by 300
  3. 2019Optimal Policies Tend to Seek Powercited by 119
  4. 2017AI Safety Gridworldscited by 110
  5. 2017Leave no Trace: Learning to Reset for Safe and Autonomous Reinforcement Learningcited by 90
  6. 2020Inverse Constrained Reinforcement Learningcited by 46
  7. 2018Penalizing side effects using stepwise relative reachabilitycited by 38
  8. 2019Conservative Agency via Attainable Utility Preservationcited by 35
  9. 2020Avoiding Side Effects By Considering Future Taskscited by 32
  10. 2020Avoiding Side Effects in Complex Environmentscited by 24
  11. 2019SafeLife 1.0: Exploring Side Effects in Complex Environmentscited by 8

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 0; 2025: 1.

3 papers.