AI Debate
In AI debate, two models argue opposing answers and a weaker judge picks the winner. How the 2018 proposal works, what experiments found, and its limits.
AI debate is an AI safety technique in which two AI systems argue for competing answers to a question while a judge, usually a person or a weaker model, decides which side made the stronger case. Geoffrey Irving, Paul Christiano, and Dario Amodei proposed it at OpenAI in the 2018 paper AI Safety via Debate as a form of scalable oversight, a way for people to supervise AI systems on tasks too hard for them to check directly. It rests on the idea that finding the flaw in an argument is easier than producing the right answer, and that an opponent has every reason to point the flaw out.
How a Debate Game Works#
A question or proposed action goes to two AI agents. They take turns making short statements for a fixed number of rounds, each trying to convince the judge, and the judge's verdict becomes the reward. The game is zero-sum, so training both agents through self-play with reinforcement learning pushes each one to expose the other's mistakes. If a lie is easier to refute than to defend, the winning strategy is to tell the truth.
The original paper made the argument precise with an analogy to computational complexity theory. With optimal play, debate lets a judge limited to polynomial time answer any question in the class PSPACE, while judging a single answer directly only reaches NP. Its first experiment used images. Two agents took turns revealing pixels of an MNIST digit to a sparse image classifier that saw nothing else, one arguing for the true digit and one for a false one. Debate raised the judge's accuracy from 59.4% to 88.9% with 6 revealed pixels, and from 48.2% to 85.2% with 4.
Experiments With Language Models#
Later experiments tested debate with large language models (LLMs). In the 2024 study Debating with More Persuasive LLMs Leads to More Truthful Answers, led by Akbir Khan, two expert models that could read a long story argued for different answers to a reading-comprehension question, while judges who could not see the story picked a side. Debate raised accuracy to 76% for model judges and 88% for human judges, compared with 48% and 60% for naive baselines. Optimizing the debaters for persuasiveness made judges more accurate, which is the direction debate needs. Quotes from the story were checked automatically and marked as genuine, so a debater could not invent evidence. This information asymmetry, where debaters see a source the judge cannot, is how most debate experiments stand in for a future model that knows more than its overseer.
A larger Google DeepMind study by Zachary Kenton and colleagues, On Scalable Oversight with Weak LLMs Judging Strong LLMs, compared debate with consultancy, where a single AI argues for an assigned answer, across many tasks. Debate beat consultancy on every task when the consultant was randomly assigned a side, and it beat a judge answering directly on extractive question answering with information asymmetry, while results on tasks without that asymmetry were mixed.
Verifiable evidence matters just as much when the debate is about an image, as in visual question answering. An object detector such as Ultralytics YOLO26 supplies boxes and class labels that a judge can check a claim against, such as "two people are inside the marked walkway", in the same way quote verification grounds a debate about text.
Comparison With Other Oversight Methods#
- Reinforcement learning from human feedback (RLHF): Raters judge outputs directly, which works while people can tell good answers from bad ones. Debate targets the cases where they cannot.
- Multi-agent debate for reasoning: An inference-time variant in which several copies of a model propose answers, read each other's responses, and revise them over a few rounds. It improves arithmetic and factual accuracy without a trained judge, and the exchange of arguments sets it apart from an ensemble, which combines independent predictions.
- Constitutional AI: A model critiques and revises outputs against written principles, replacing much human labeling with AI feedback. Debate gets its critique from an opponent with an incentive to find errors.
- AI red teaming: Human or automated adversaries probe a finished system for failures. In debate, the adversarial pressure comes from the opposing debater inside every answer.
- Superalignment: The broader research agenda of aligning systems more capable than their overseers. Debate is one candidate method within it, alongside approaches such as recursive reward modeling and weak-to-strong generalization.
Known Weaknesses#
Judges bring their own biases. Confident tone, length, and fluent style can win over correctness, and model judges are prone to AI sycophancy. When both debaters are copies of the same model, they can share the same misconceptions, so neither raises an error and a hallucination passes unchallenged. Debate is also expensive, since every question needs several rounds of long-context generation plus a judgment.
The most studied failure is the obfuscated argument. A dishonest debater can build a long chain of reasoning in which one step is wrong but hard to find. The honest debater may know the conclusion is false without being able to point to the broken step within the allowed rounds, and the judge then has no basis for a decision. Human experiments run by Beth Barnes and Paul Christiano in 2020 surfaced this problem. In 2025, Jonah Brown-Cohen, Geoffrey Irving, and Georgios Piliouras proposed prover-estimator debate, in which one AI splits its argument into subclaims and the other assigns each a probability, to make honest play the winning strategy even when a flaw is hard to locate.










