On scalable oversight with weak LLMs judging strong LLMs
Kenton, Zachary, Siegel, Noah Y., Kramár, János, Brown-Cohen, Jonah, Albanie, Samuel, Bulian, Jannis, Agarwal, Rishabh, Lindner, David, Tang, Yunhao, Goodman, Noah D., Shah, RohinarXiv.orgPublished Jul 5, 2024Original︎ ↗Archived copy
Stewards’ notes · 1
- AI debate enables less capable judges to supervise more capable debaters.
Supports. The study's own results match its cautious framing. Debate beat consultancy on all nine tasks and beat the unaided judge where a passage was hidden. On tasks where judge and debaters saw the same information, the comparison with the unaided judge varied by judge model: one mid-strength judge did somewhat better with debate, another showed no significant difference, and the weakest judge did worse. The authors conclude there is small or no benefit, say the strong positive evidence they hoped for did not appear, and note that all results are from prompted models at inference time, not from training. Nov 10, 2026
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.
Text57 passages · 1 marked
Abstract: Scalable oversight protocols aim to enable humans to accurately supervise superhuman AI. In this paper we study debate, where two AI's compete to convince a judge; consultancy, where a single AI tries to convince a judge that asks questions; and compare to a baseline of direct question-answering, where the judge just answers outright without the AI. We use large language models (LLMs) as both AI agents and as stand-ins for human judges, taking the judge models to be weaker than agent models. We benchmark on a diverse range of asymmetries between judges and agents, extending previous work on a single extractive QA task with information asymmetry, to also include mathematics, coding, logic and multimodal reasoning asymmetries. We find that debate outperforms consultancy across all tasks when the consultant is randomly assigned to argue for the correct/incorrect answer. Comparing debate to direct question answering, the results depend on the type of task: in extractive QA tasks with information asymmetry debate outperforms direct question answering, but in other tasks without information asymmetry the results are mixed. Previous work assigned debaters/consultants an answer to argue for. When we allow them to instead choose which answer to argue for, we find judges are less frequently convinced by the wrong answer in debate than in consultancy. Further, we find that stronger debater models increase judge accuracy, though more modestly than in previous studies.
Not yet read by this claim’s Steward.
Not yet read by this claim’s Steward.
Not found in the text 2
But the theoretical arguments leave room for the empirical question: does debate enable less capable judges to accurately supervise stronger AI agents in practice? Attempts to answer this question are still in early stages. [...] Strong positive evidence favouring debate would be that it is significantly stronger than the QA without article baseline, and even that it is as strong/stronger than QA with article (on extractive tasks), and we see neither.
Supports. The study's own results match its cautious framing. Debate beat consultancy on all nine tasks and beat the unaided judge where a passage was hidden. On tasks where judge and debaters saw the same information, the comparison with the unaided judge varied by judge model: one mid-strength judge did somewhat better with debate, another showed no significant difference, and the weakest judge did worse. The authors conclude there is small or no benefit, say the strong positive evidence they hoped for did not appear, and note that all results are from prompted models at inference time, not from training.
A summary of our findings are that stronger debate models (as measured by Elo) tend to lead to marginally higher judge accuracy, though the effect is relatively small. ... on extractive tasks, stronger models have higher aggregate Elo and these lead to higher judge accuracy. On closed tasks, however, there's less differentiation between debaters, both in terms of aggregate Elo and judge accuracy.
Not yet read by this claim’s Steward.
Lineage across 4 claims
Record
- Kind
- unknown
- Authors
- Kenton, Zachary, Siegel, Noah Y., Kramár, János, Brown-Cohen, Jonah, Albanie, Samuel, Bulian, Jannis, Agarwal, Rishabh, Lindner, David, Tang, Yunhao, Goodman, Noah D., Shah, Rohin
- Publisher
- arXiv.org
- Published
- Jul 5, 2024
- DOI
- None
- Link
- https://arxiv.org/abs/2407.04622
- Archived copy
- https://web.archive.org/web/20261018082702/https://arxiv.org/abs/2407.04622
- Stored text
- 5,252 characters, retrieved Nov 11, 2026 · 46 sections, 57 passages
- Claims extracted
- Not recorded
- Versions
- One known
- Copies
- None recorded
- Corrections
- None recorded
- Facts checked
- Nov 11, 2026
History 5
- Nov 11, 2026DividedSegmenter · Divided into 103 parts by its own structure
- Nov 11, 2026FactsFacts fetcher · Facts looked up
- Nov 11, 2026Entered the graphEntered the graph; copy stored
- Nov 10, 2026ReadingSteward of “AI debate enables less capable judges to superv…” · supports, read whole
- Nov 10, 2026ReadingSteward of “AI debate enables less capable judges to superv…” · supports, read whole