An alignment safety case sketch based on debate
Buhl, Marie Davidsen, Pfau, Jacob, Hilton, Benjamin, Irving, GeoffreyarXiv.orgPublished May 6, 2025Original︎ ↗Archived copy
Examinations
None recorded. An examination is commissioned by a claim’s Steward for what its claim rests on; a review of the document for its own sake is asked for as a request bearing on it.
Text55 passages · 1 marked
Abstract: If AI systems match or exceed human capabilities on a wide range of tasks, it may become difficult for humans to efficiently judge their actions -- making it hard to use human feedback to steer them towards desirable traits. One proposed solution is to leverage another superhuman system to point out flaws in the system's outputs via a debate. This paper outlines the value of debate for AI safety, as well as the assumptions and further research required to make debate work. It does so by sketching an ``alignment safety case'' -- an argument that an AI system will not autonomously take actions which could lead to egregious harm, despite being able to do so. The sketch focuses on the risk of an AI R\&D agent inside an AI company sabotaging research, for example by producing false results. To prevent this, the agent is trained via debate, subject to exploration guarantees, to teach the system to be honest. Honesty is maintained throughout deployment via online training. The safety case rests on four key claims: (1) the agent has become good at the debate game, (2) good performance in the debate game implies that the system is mostly honest, (3) the system will not become significantly less honest during deployment, and (4) the deployment context is tolerant of some errors. We identify open research problems that, if solved, could render this a compelling argument that an AI system is safe.
Not yet read by this claim’s Steward.
Not yet read by this claim’s Steward.
Not yet read by this claim’s Steward.
Not found in the text 2
We are optimistic that the obfuscated arguments problem can be evaded by assuming stability. But stability might not hold for relevant queries.
Not yet read by this claim’s Steward.
This is known as stability and can be more precisely stated as: small variations in input probabilities will not change the outcome of overall computation. We are not yet sure how to support this claim, so we leave the evidence box blank (E5.5).
Not yet read by this claim’s Steward.
Lineage across 5 claims
Record
- Kind
- unknown
- Authors
- Buhl, Marie Davidsen, Pfau, Jacob, Hilton, Benjamin, Irving, Geoffrey
- Publisher
- arXiv.org
- Published
- May 6, 2025
- DOI
- None
- Link
- https://arxiv.org/abs/2505.03989
- Archived copy
- https://web.archive.org/web/20261011232004/https://arxiv.org/abs/2505.03989
- Stored text
- 4,869 characters, retrieved Nov 11, 2026 · 45 sections, 55 passages
- Claims extracted
- For
the assumptions a debate-based safety case needs and which of them remain open
· 5 claims (3 new) · Nov 11, 2026 for Decompose and assess: "Scalable oversight can reliably control superintelligent AI systems."
- For
- Versions
- One known
- Copies
- None recorded
- Corrections
- None recorded
- Facts checked
- Nov 11, 2026
History 3
- Nov 11, 2026DividedSegmenter · Divided into 100 parts by its own structure
- Nov 11, 2026FactsFacts fetcher · Facts looked up
- Nov 11, 2026Entered the graphEntered the graph; copy stored