Measuring Collapse and Correction in Homogeneous-Panel LLM Debate
Xin Li, Mengbing Liu, Chau Yuen
Nanyang Technological University
Published September 28, 2026 · on the feed September 29, 2026 · ▲ 5 · arXiv 2609.35279
The abstract
Multi-agent large language model (LLM) debate is often evaluated by whether final answers improve, but movement is not necessarily improvement: the same discussion can rescue an initially wrong majority or destroy an initially correct one. Standard final-accuracy evaluations conflate these opposing mechanisms. We introduce an auditable protocol for homogeneous debate on multiple-choice questions (MCQs) that records each run as a transition ledger over collapse, correction, onset, and signed intervention utility. On 6,925 MMLU-Pro debates, the protocol identifies 253 collapses and a parallel correction ledger that changes how interventions should be judged. Replay experiments reveal the central tradeoff: a leave-one-model-out probe-gated freeze prevents 29 collapses but loses 108 corrections under equal weights, so collapse prevention alone can recommend the wrong policy. A compact pre-debate 8-probe screen is a triage signal: its unadjusted family-level association with conditional-collapse risk is high (G=7, Spearman rho=0.893, exact two-sided p=0.0123), but initial-majority accuracy is a close comparator (rho=0.821; family partial rho=0.767, p=0.0877), so we do not treat it as calibrated or capability-adjusted prediction. Round-level traces localize many collapses to the first debate round, where early disagreement can precede both harmful cascades and useful recovery. We release replayable schemas, coders, audits, cost cards, and zero-API rebuild scripts so future model-scaffold rows can be compared under the same denominators and signed utility ledger.
The Brief
2:34A short podcast summary of the paper. Written and voiced by AI.
Transcript
Measuring Collapse and Correction in Homogeneous-Panel LLM Debate. By Xin Li and two others, from Nanyang Technological University. Published on the twenty-eighth of September. Its code repository is worked out: about seventy source files, with a readme and a licence.
Debate among several large language model agents is usually judged by whether the final answers improve. But movement is not the same as improvement. One discussion can rescue a majority that started out wrong, and the same kind of discussion can destroy a majority that started out right. Standard final-accuracy evaluations fold these opposing mechanisms into one number and hide both.
The authors introduce an auditable protocol for homogeneous debate on multiple-choice questions. It records each run as a transition ledger over four entries: collapse, correction, onset, and signed intervention utility. Every debate becomes an account of what moved, in which direction, and when, and any intervention can be charged against both sides of that account.
The protocol is applied to six thousand nine hundred and twenty-five debates on MMLU-Pro. Replay experiments then test interventions against the ledger. A compact screen of eight probes, run before the debate starts, is examined as an early warning, and traces at the level of individual rounds show where in a debate things change.
The ledger identifies two hundred and fifty-three collapses, together with a parallel correction ledger that changes how interventions should be judged. Replays expose the central tradeoff. A probe-gated freeze, tested leave-one-model-out, prevents twenty-nine collapses but loses one hundred and eight corrections under equal weights. Counting only collapses prevented, it looks like a win. Counting both, it is the wrong policy.
The eight-probe screen works as a triage signal. Its unadjusted association with conditional collapse risk, measured at the level of model families, is high: a Spearman rho of zero point eight nine three. But the accuracy of the initial majority is a close comparator, at zero point eight two one, so the authors decline to treat the screen as calibrated prediction, or as prediction adjusted for capability. Round-level traces place many collapses in the first debate round, where early disagreement can come before harmful cascades and useful recovery alike.
The release is built for comparison: replayable schemas, coders, audits, cost cards and rebuild scripts that need no API calls, so future rows pairing a model with a scaffold can be scored under the same denominators and the same signed ledger. Underneath the tooling is a bookkeeping rule. An intervention should be credited for the collapses it stops and charged for the rescues it blocks.
Paper Quest · 7 chapters · about 40 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
Debate is meant to fix mistakes. But answers can move both ways.
You run three copies of one language model as a debate panel on multiple-choice questions. They answer, read each other, and revise. You score the panel by final accuracy, and it looks fine.
The road ahead
- 1 · The problem ~7 min A debate panel's final accuracy can look fine while hiding whether discussion rescued wrong answers or destroyed right ones.
- 2 · What came before ~3 min
- 3 · The key idea ~8 min Record each debate by whether its starting and final majorities were right, then score any intervention on both losses prevented and rescues blocked.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Run same-model debates, log each as a transition ledger, replay interventions on the saved runs, and weigh what they prevent against what they lose.
- 6 · The experiment ~6 min You’ll guess: A probe-gated freeze stops LLM debates judged likely to collapse a correct majority. Counting collapses prevented against corrections lost, how did it come out?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.