用贝叶斯方法替代传统评估,让大模型表现排名更稳定可信。
Don't Pass@k: A Bayesian Framework for Large Language Model Evaluation
- 基于贝叶斯后验估计模型真实成功率和可信区间,取代传统Pass@k
- 在少样本条件下仍能快速收敛,排名稳定性显著提升
- 支持分级评分,明确区分统计显著差异与随机噪声
Pass@k广泛用于评估大语言模型的推理能力,但在样本量有限、计算资源受限时,常导致不稳定甚至误导性的排名。本文提出一种基于贝叶斯框架的评估方法,以模型成功概率的后验估计和可信区间替代Pass@k与平均准确率(avg@N)。通过引入狄利克雷先验,将评估结果建模为类别分布,可闭式计算任意加权评分的后验均值与不确定性,合理利用先验信息。理论上,在均匀先验下,后验均值与平均准确率(Pass@1)有序等价,解释了其经验稳健性并加入严谨不确定性量化。实验上,在已知真实成功率的模拟数据以及AIME'24/'25、HMMT'25、BrUMO'25数据集上,该方法实现更快收敛与更高排名稳定性,可在极小样本下可靠比较模型。该框架能清晰识别统计显著差异(可信区间不重叠)与噪声,自然扩展至分级评分。结果表明,应以该后验驱动、计算高效的评估协议取代Pass@k,统一处理二元与非二元评估,并显式表达不确定性。源代码已开源:https://github.com/mohsenhariri/scorio
原文摘要 · Abstract (English)
Pass$@k$ is widely used to report the reasoning performance of LLMs, but it often produces unstable and potentially misleading rankings, especially when the number of trials (samples) is limited and computational resources are constrained. We present a principled Bayesian evaluation framework that replaces Pass$@k$ and average accuracy over $N$ trials (avg$@N$) with posterior estimates of a model's underlying success probability and credible intervals, yielding stable rankings and a transparent decision rule for differences. Evaluation outcomes are modeled as categorical (not just 0/1) with a Dirichlet prior, giving closed-form expressions for the posterior mean and uncertainty of any weighted rubric and enabling the use of prior evidence when appropriate. Theoretically, under a uniform prior, the Bayesian posterior mean is order-equivalent to average accuracy (Pass$@1$), explaining its empirical robustness while adding principled uncertainty. Empirically, in simulations with known ground-truth success rates and on AIME'24/'25, HMMT'25, and BrUMO'25, the posterior-based procedure achieves faster convergence and greater rank stability than Pass$@k$ and recent variants, enabling reliable comparisons at far smaller sample counts. The framework clarifies when observed gaps are statistically meaningful (non-overlapping credible intervals) versus noise, and it naturally extends to graded, rubric-based evaluations. Together, these results recommend replacing Pass$@k$ for LLM evaluation and ranking with a posterior-based, compute-efficient protocol that unifies binary and non-binary evaluation while making uncertainty explicit. Source code is available at https://github.com/mohsenhariri/scorio
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。