Scalable AI Safety via Doubly-Efficient Debate

Jonah Brown-Cohen, Geoffrey Irving, Georgios Piliouras
2/12/2026

No official code found. Best implementation: google-deepmind/debate (120 stars, Apache-2.0, last commit 2024-10-08).

Abstract

The emergence of pre-trained AI systems with powerful capabilities across a diverse and ever-increasing set of complex domains has raised a critical challenge for AI safety as tasks can become too complicated for humans to judge directly. Irving et al. [2018] proposed a debate method in this direction with the goal of pitting the power of such AI models against each other until the problem of identifying (mis)-alignment is broken down into a manageable subtask. While the promise of this approach is clear, the original framework was based on the assumption that the honest strategy is able to simulate deterministic AI systems for an exponential number of steps, limiting its applicability. In this paper, we show how to address these challenges by designing a new set of debate protocols where the honest strategy can always succeed using a simulation of a polynomial number of steps, whilst being able to verify the alignment of stochastic AI systems, even when the dishonest strategy is allowed to use exponentially many simulation steps.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Formalizing stochastic doubly-efficient debate

12017LeanNov 24, 20232 years agoApache-2.0
lean4

Similar Papers

Cite this paper

@article{browncohen2026scalable,
  title  = {Scalable AI Safety via Doubly-Efficient Debate},
  author = {Jonah Brown-Cohen and Geoffrey Irving and Georgios Piliouras},
  year   = {2026},
  eprint = {2311.14125},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2311.14125},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.14125.svg)](https://codeofpaper.com/paper/2311.14125)

Discussion