The paper shows that classical consensus theory, which relies on network topology and convex update rules, fails for large language models (LLMs). By measuring token‑level updates across eight instruction‑tuned models and 73,080 exchanges, the authors find that LLMs violate convexity, exhibit negative weights, and are driven by internal update bias rather than network structure. Simulations with 10,000 agents confirm that algebraic connectivity explains almost none of the outcome variance, leading populations to converge on confidently false claims regardless of their network topology.
By Sahil Rajesh Dhayalkar
The paper introduces TalkMesh, a decentralized network of small language model agents that learn to communicate effectively during inference. Each agent proposes an answer, scores it with a confidence head, and the most confident agent broadcasts a hint; lower‑confidence agents revise their proposals if a new suggestion scores higher. This gossip‑based consensus, trained via group relative policy optimization, enables a mesh of three agents to match the accuracy of majority voting over 32 samples, and scales to larger meshes to significantly boost performance on benchmarks like GSM8K and MATH-500.
By Mehmet Kerem Turkcan
arXiv:2609.24146v1 Announce Type: new
Abstract: Language model agents are increasingly used to simulate social interaction, and the resulting transcripts read as though the agents understand one anot...
By Cong Li, Cheng Chen, Thomas Fung, Alex Rossi, Yi Li
The paper investigates when the integrated information measure ζ (phi) can be reliably identified from finite, noisy experiments in small stochastic networks. It shows that even identical input‑output behavior can hide large differences in phi, that partial recordings impose hard precision limits, and that phi is highly sensitive to infinitesimal mechanism changes, often misreported by surrogate models. The authors prove that a lower bound on phi can be certified with controlled experiments and quantify the sample size needed for statistical confidence.
By Linqian Wu, Diaoxuan He
arXiv:2609.14754v1 Announce Type: cross
Abstract: Causal claims about large language model (LLM) internals rest on measurements. Those might include a projection, a cosine, an ablation delta, or an i...
By Orion Reblitz-Richardson
arXiv:2604. 07667v2 Announce Type: replace Abstract: Multi-agent debate improves LLM reasoning, yet agreement is not evidence of correctness.
By Mengdie Flora Wang, Haochen Xie, Guanghui Wang, Aijing Gao, Guang Yang, Ziyuan Li, Qucy Wei Qiu, Fangwei Han, Hengzhi Qiu, Yajing Huang, Bing Zhu, Jae Oh Woo
arXiv:2609.08016v1 Announce Type: new
Abstract: Multi-agent debate, in which several LLMs exchange arguments before answering, is widely assumed to improve answer quality by surfacing genuine disagre...
By Chen Qian
arXiv:2610.23246v1 Announce Type: cross
Abstract: Reasoning systems increasingly improve answers by incorporating additional context into the model's input, from multi-agent debate, where agents read...
By Manh Nguyen, Sunil Gupta, Hung Le
arXiv:2609.38324v1 Announce Type: cross
Abstract: Multi-agent systems of LLMs add discussion to majority voting and are therefore expected to be more capable. However, empirical reports conflict on w...
By Chand Sahil Mansuri, Xin Wang, Mengying Li, Bryan Acton, Rory Eckardt, Dhaval Patel, Sadamori Kojaku
The study examines how shared item‑level error limits the benefit of aggregating small language models in Fermi estimation tasks. By decomposing log10 errors into item‑specific and residual components across 2.51 million answers from 15 open‑weight models, it finds that item‑level error accounts for about 91% of variance, reducing the expected error gain from 74–79% to only 1.7–5.4% when using teams of thirty. Additional techniques such as debate, model mixing, and temperature adjustments offer modest improvements, but no method surpasses the most accurate single model.
By Carolina Fortuna, Blaz Bertalanic
arXiv:2608. 14509v1 Announce Type: new Abstract: Systems that ask a language model to reach a conclusion from many sources usually concatenate them into one prompt.
By Zhelun Wu
The study examines how shared item‑level error limits the benefit of aggregating small language models in Fermi estimation tasks. By decomposing log10 errors into item‑specific and residual components across 2.51 M answers from 15 open‑weight models, it finds that item‑level error accounts for about 91 % of variance, reducing the expected error gain from a 30‑model team to only 1.7 % (max 5.4 %) instead of the theoretical 74‑79 %. Techniques such as three rounds of debate, model mixing, and temperature adjustments yield modest improvements, but no method surpasses the most accurate single model.