Skip to content

Fundamental Impossibility Results in AI Safety: Trading Off between Desiderata

Oct 2026 · 0 citations · 47 references
Computer Science

TL;DR

This work formalizes the interaction between AI systems and users as a game with three players: a defender and an attacker that are computationally or informationally bounded, and an AI that provides public advice and is less constrained.

Abstract

Is there a fundamental tradeoff between desiderata for safe AI systems, such as harmlessness and helpfulness? We answer by formalizing the interaction between AI systems and users as a game with three players: a defender and an attacker that are computationally or informationally bounded, and an AI that provides public advice and is less constrained. Our main result shows that there is a fundamental tradeoff in providing advice that helps the defender while advice remains public. We also consider whether the information that the AI shares can be manipulated to benefit only the defender and conclude with a discussion of how we can use these results in designing safer AI systems.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Defensive Sufficiency in a Stackelberg Model of AI Security

Feedback from automated testing, human red teaming, and incident response can strengthen an AI system's defenses when discovered failures lead to effective repairs. We study when this feedback process provides sufficient protection and when investing in it is economically worthwhile. We begin by showing that an attack...

Subhabrata Majumdar, Rajlakshmi Chavan · 0 citations
#artificial intelligence Preprint Sep 2026

When Honesty is Not Enough in AI Debate

The framework strategic interactive oversight (SIO), which treats oversight jointly as a verification mechanism and a strategic communication channel, is introduced and the notion of task-admissible latent optimisation is formalised, which entails the pursuit of latent objectives while maintaining a prescribed task per...

Rayne Holland, Li-Ming Zhu, Jason Xue · 0 citations
Open access Oct 2026

Asynchronous Repetition of Interactive Proof Systems

We analyze whether strategic provers can gain an advantage by coordinating their actions across multiple simultaneous games, specifically within the context of parallel repetition and error reduction for interactive proof systems. Suppose the verifier uses a Boolean decision rule, f , that aggregates the re...

Ohad Koren, M. Naor, Théodore Conrad-Frenkiel · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.