跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2604.17139 · v2

The Consensus Trap: Collaborative Interleaved Generation to Defend against a Corrupted Majority

首次提交 2026-04-19 04:31
版本更新 2026-11-06 19:13
雷达观测 2026-11-09 11:19
arXiv ↗PDF ↗

摘要

Majority voting offers a simple way to combine answers from multiple large language model (LLM) agents. When a majority follows instructions favoring the same incorrect answer, however, agreement reinforces the error. We call this failure the "consensus trap": a minority may identify the error, yet its reasoning cannot change a vote over completed answers. We introduce chunk-interleaved Round-Robin (RR) collaboration, in which agents take turns extending one unfinished reasoning trajectory. A minority of agents with correct reasoning can insert corrections that subsequent speakers read before the answer is complete. RRMaj combines several such trajectories by a final vote. We characterize a majority barrier for outcome-level voting over final answer labels and derive a local sufficient condition for expected progress when the minority's cumulative corrections outweigh opposing corrupted updates. Across model families and verifiable reasoning benchmarks, RRMaj substantially improves accuracy under majority corruption while retaining comparable average performance under minority corruption in the main advisory-instruction setting. RR also strengthens full-response debate. Scoring the shared reasoning between turns shows that, on average, continuations from uncorrupted agents increase support for the correct answer over the incorrect target. Parallel local serving adds modest latency in the measured deployment. These findings show how language shared during reasoning, and the timing of that exchange, can help a minority correct a group's answer.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-06 19:13 · 最新观测版本

The Consensus Trap: Collaborative Interleaved Generation to Defend against a Corrupted Majority

Majority voting offers a simple way to combine answers from multiple large language model (LLM) agents. When a majority follows instructions favoring the same incorrect answer, however, agreement reinforces the error. We call this failure the "consensus trap": a minority may identify the error, yet its reasoning cannot change a vote over completed answers. We introduce chunk-interleaved Round-Robin (RR) collaboration, in which agents take turns extending one unfinished reasoning trajectory. A minority of agents with correct reasoning can insert corrections that subsequent speakers read before the answer is complete. RRMaj combines several such trajectories by a final vote. We characterize a majority barrier for outcome-level voting over final answer labels and derive a local sufficient condition for expected progress when the minority's cumulative corrections outweigh opposing corrupted updates. Across model families and verifiable reasoning benchmarks, RRMaj substantially improves accuracy under majority corruption while retaining comparable average performance under minority corruption in the main advisory-instruction setting. RR also strengthens full-response debate. Scoring the shared reasoning between turns shows that, on average, continuations from uncorrupted agents increase support for the correct answer over the incorrect target. Parallel local serving adds modest latency in the measured deployment. These findings show how language shared during reasoning, and the timing of that exchange, can help a minority correct a group's answer.

查看此版本解读 →查看此版本原文 ↗