arXiv cs.CL· Manh Nguyen, Sunil Gupta, Hung Le·· 13 小时前AI 评分34
无需训练的高效 Best-of-N 选择方法：Radial Consensus Score
Efficient Best-Of-N with Radial Consensus Score
AI 导读
研究者提出 Radial Consensus Score（RCS），一种无需训练、简单高效的 best-of-N 答案选择方法，通过计算答案嵌入的加权 Frechet 均值作为语义中心，按候选到中心的径向距离排序。
正文 · 原文
Abstract:Solving complex problems with large language models (LLMs) often requires selecting the best answer from multiple candidate responses (best-of-$N$), yet identifying the most reliable one remains challenging, particularly when correctness does not align with majority agreement. Existing approaches based on voting or probability scoring rely on surface-level signals (e.g., frequency or token-level likelihood), often missing high-quality rare answers and ignoring the geometric structure of candidate representations, where correctness may emerge as semantic consistency rather than surface agreement. 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 Frechet mean (semantic center) of answer embeddings and ranking candidates by their radial distance to this center. This enables it to recover semantically coherent correct answers despite lexical fragmentation, even when no single surface form holds a plurality under exact-match voting. Importantly, RCS offers a flexible framework that supports multiple weighting schemes, enabling the integration of arbitrary signals, such as semantic agreement or model confidence, with the position of the center adapting accordingly. Extensive experiments across five open-weight models and various benchmarks demonstrate that RCS matches or outperforms strong baselines at every sampling budget, with the largest gains when correct answers are lexically fragmented. Moreover, RCS serves as an effective drop-in replacement for majority voting in multi-agent debate and remains effective in black-box scenarios. These results suggest that geometric consensus can serve as a scalable and reliable alternative to voting-based methods for answer selection. Code is publicly available at this https URL.
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2604.12196 [cs.CL] |
| (or arXiv:2604.12196v2 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2604.12196 arXiv-issued DOI via DataCite |
Submission history
From: Manh Nguyen [view email]
[v1]
Tue, 14 Apr 2026 02:02:20 UTC (216 KB)
[v2]
Wed, 21 Oct 2026 22:40:59 UTC (213 KB)
来源：arXiv cs.CL · arxiv.org