arXiv AI

A latent dimension of Condorcet's jury theorem for multiple AI advisers

arXiv Computation and Language
Oct 19

Same Person, Different Advice: Auditing LLM Financial Advice with Repeated Risk-Tolerance Responses

The study examines how large language models (LLMs) provide financial advice based on a single risk‑tolerance question, finding that both human respondents and LLMs exhibit significant variability when the same question is repeated. In a national US panel, 41% of households changed their risk answer after two years, and in a lab retest a third changed by two or more points on a 0‑10 scale after six months. When LLMs were given 800 real household profiles with only the risk answer altered, the recommended stock allocation shifted by 10–16 percentage points on average, and by 24–35 points when the answer changed, compared to minimal swings when the same prompt was repeated. The study also shows that adding clarifying questions or noting answer noise can reduce these swings, especially for younger clients and those with extreme risk attitudes. whyItMatters":"The findings highlight that LLMs can produce markedly different financial advice from a single, potentially unreliable risk‑tolerance response, underscoring the need for repeat‑testing and transparency in AI‑driven financial recommendations."

By Soovadeep Bakshi, Apurba Bose, Aishwarya Bose, Sandip Nandi
arXiv AI
Sep 7

Measuring AI Accountability Through Argumentation Analysis: Can Model Reasoning Withstand Scrutiny?

The paper proposes a new method for evaluating AI accountability by analyzing the structural quality of a model’s defense for its decisions, using a four‑phase dialectical protocol based on Walton’s argumentation schemes and Govier’s criteria. Applied to nine large language models and 200 ambiguous moral-choice items, the study finds that models generally defend their reasoning well above the rubric minimum, though failures cluster on grounds and sufficiency and correlate with epistemic hedging. The protocol also reveals that models often present different argument schemes in justification than in reasoning, detects indefensible defenses, and highlights challenges in assessing retraction in AI alignment.

By Daan R. Henselmans, Derck W. E. Prinzhorn, Arno Libert
arXiv AI
Oct 21

Humans Correct Their Judgments Through Debate, but Weaker AI Models Do Not

The paper examines whether AI‑driven debate can help humans and weaker language models (LLMs) correct their judgments. Experiments show that debate improves human accuracy over prior beliefs, especially with weighted voting, but offers little benefit—and sometimes harms—accuracy for weaker LLM supervisors. The study highlights debate as a promising tool for scalable human oversight while questioning its effectiveness for fully automated AI control.

By Maria Victoria Carro, Denise Alejandra Mester, Facundo Nieto, Oscar Agustin Stanchi, Guido Ernesto Bergman, Giovanni Franco Gabriel Marrafini, Trinidad Borrell, Guido Freire, Joaquin Salvador Machulsky, Mario Alejandro Leiva, Ana Lopez, Nicolas Spinelli, Luca Nicolas Forziati Gangi, Eitan Sprejer, Federico Barrera Lemarchand, Gerardo Simari, Maria Vanina Martinez
arXiv AI
Jun 2

Demystifying Multi-Agent Debate: The Role of Confidence and Diversity

arXiv:2601. 19921v2 Announce Type: replace-cross Abstract: Multi-agent debate (MAD) is widely used to improve large language model (LLM) performance through test-time scaling, yet recent work shows that vanilla MAD often underperforms simple majority vote despite higher computational cost.

By Xiaochen Zhu, Caiqi Zhang, Yizhou Chi, Tom Stafford, Nigel Collier, Andreas Vlachos
arXiv AI
Oct 2

Counting Moves, Weighing Voices: Bayesian Dialectical Argumentation for Calibrated Multi-LLM Councils under Persistent Adversaries

The paper introduces Bayesian Dialectical Argumentation (BDA), a method for aggregating answers from multiple large language models (LLMs) in a council setting. BDA treats each LLM’s typed moves—proposals, challenges, and concessions—as evidence in a classical annotator model, estimating per-agent reliability even when some agents are persistently unreliable. By weighting evidence according to these inferred reliabilities, BDA produces calibrated posterior probabilities for candidate answers and can invert unreliable agents instead of merely outvoting them, achieving superior calibration and robustness on both binary and multi-class benchmarks without extra LLM calls.

By Ionel Eduard Stan, Paolo Napoletano