mlsanityData to 7 Oct 2026

Dynamic Safe Interruptibility for Decentralized Multi-Agent Reinforcement Learning

arXiv 1704.02882 ↗First posted 10 Apr 2017cs.AI cs.LG cs.MAcited by 4

Not on the map. Why?

Abstract (arXiv)

In reinforcement learning, agents learn by performing actions and observing their outcomes. Sometimes, it is desirable for a human operator to textitinterrupt an agent in order to prevent dangerous situations from happening. Yet, as part of their learning process, agents may link these interruptions, that impact their reward, to specific states and deliberately avoid them. The situation is particularly challenging in a multi-agent context because agents might not only learn from their own past interruptions, but also from those of other agents. Orseau and Armstrong defined safe interruptibility for one learner, but their work does not naturally extend to multi-agent systems. This paper introduces textitdynamic safe interruptibility, an alternative definition more suited to decentralized learning problems, and studies this notion in two learning frameworks: textitjoint action learners and textitindependent learners. We give realistic sufficient conditions on the learning algorithm to enable dynamic safe interruptibility in the case of joint action learners, yet show that these conditions are not sufficient for independent learners. We show however that if agents can detect interruptions, it is possible to prune the observations to ensure dynamic safe interruptibility even for independent learners.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Apr 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2018: 1; 2019: 0; 2020: 0; 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

4 papers.