paper-with-me

홈 › Papers

Beyond Majority Voting: Efficient Best-Of-N with Radial Consensus Score

2026-04-14 · Manh Nguyen, Sunil Gupta, Hung Le arxiv

Large language models (LLMs) frequently generate multiple candidate responses for a given prompt, yet selecting the most reliable one remains challenging, especially when correctness diverges from surface-level majority agreement. Existing approaches, such as self-consistency, rely on discrete voting, while probability-based methods often fail to capture relationships among candidate answers or tend to underweight high-quality but less frequent responses, and do not fully leverage the geometric structure of answer representations. To address these limitations, we introduce Radial Consensus Score (RCS), a simple, efficient, and training-free method for best-of-N selection. RCS models semantic consensus by computing a weighted Fréchet mean (semantic center) of answer embeddings and ranking candidates by their radial distance to this center. Importantly, RCS provides a general framework that supports multiple weighting schemes, including uniform, frequency-based, and probability-based variants, enabling flexible integration of agreement signals and model confidence while remaining fully applicable in black-box settings. Extensive experiments across seven benchmarks covering short-form QA and long-form reasoning tasks, and five open-weight models, demonstrate that RCS variants consistently outperform strong baselines, with gains becoming more pronounced as the sampling budget increases. RCS also serves as an effective drop-in replacement for majority voting in multi-agent debate and exhibits strong robustness in black-box scenarios. Overall, these results highlight geometric consensus as a scalable and broadly applicable principle for reliable answer selection, extending beyond majority voting to more expressive and robust aggregation in LLM inference.

📄 PDF Abstract BibTeX arXiv:2604.12196

Code (0)

등록된 구현이 없습니다.

Tasks

Answer Selection

Similar Papers 제목 키워드 기반

Majority Voting for Code Generation

2026-04-17 · Tim Launer, Jonas Hübotter, Marco Bagatella, Ido Hakimi 외 arxiv

We investigate Functional Majority Voting (FMV), a method based on functional consensus for code generation with Large Language Models, which identifies a representative solution from multiple generations using their run…

Reinforcement LearningCode Generation

Voting or Consensus? Decision-Making in Multi-Agent Debate

2025-02-26 · Lars Benedikt Kaesberg, Jonas Becker, Jan Philip Wahle, Terry Ruas 외

Much of the success of multi-agent debates depends on carefully choosing the right parameters. The decision-making protocol stands out as it can highly impact final model answers, depending on how decisions are reached. …

Decision MakingMMLUStrategyQA

EMS: Multi-Agent Voting via Efficient Majority-then-Stopping

2026-04-03 · Yiqing Liu, Hantao Yao, Wu Liu, Yongdong Zhang arxiv

Majority voting is the standard for aggregating multi-agent responses into a final decision. However, traditional methods typically require all agents to complete their reasoning before aggregation begins, leading to sig…

Best-of-Majority: Minimax-Optimal Strategy for Pass@$k$ Inference Scaling

2025-10-03 · Qiwei Di, Kaixuan Ji, Xuheng Li, Heyang Zhao 외 arxiv

LLM inference often generates a batch of candidates for a prompt and selects one via strategies like majority voting or Best-of- N (BoN). For difficult tasks, this single-shot selection often underperforms. Consequently,…

Beyond Consensus: Trace-Level Synthesis in Mixture of Agents

2026-05-27 · Shreyas Fadnavis, Praitayini Kanakaraj, Felix Wyss arxiv

When multiple LLM agents solve the same problem, standard practice compresses each agent's reasoning into a majority vote or layered synthesis, treating agreement as the finish line. We show this is unnecessarily lossy: …