用加密思想设计新评测框架,揭露大模型在公开榜单上的虚高表现
How Much Do Large Language Model Cheat on Evaluation? Benchmarking Overestimation under the One-Time-Pad-Based Framework
- 基于一次性密钥原理生成动态私有测试集,防止数据泄露
- 发现当前大模型在公开榜单上存在显著性能虚高,部分结果由数据污染导致
- 每半年更新一次评测基准,适合关注模型真实能力的研究者使用
大语言模型评估中的过估计问题日益严重。由于公共基准数据泄露或训练数据分布不均,模型可能在公开榜单上取得虚高的评价结果,导致模型间不公平比较并扭曲对真实能力的判断。现有方法通过永久保密测试样本、人工评估或重复构建新样本试图缓解,但难以兼顾可复现性、透明性和高效性。此外,当前模型过估计程度尚无量化评估。为此,我们提出 ArxivRoll,一个受密码学中一次性密钥加密启发的动态评估框架。该框架包含两个核心组件:i) SCP(序列化、填空与预测),用于自动生成私有测试样例;ii) Rugged Scores(RS),用于衡量公共基准污染和训练偏差比例。ArxivRoll 每六个月利用 ArXiv 上最新论文构建新基准,实现单次评估。大量实验验证了基准质量,并对当前主流大模型进行了系统性评估。代码已开源:https://github.com/liangzid/ArxivRoll/
原文摘要 · Abstract (English)
Overestimation in evaluating large language models (LLMs) has become an increasing concern. Due to the contamination of public benchmarks or imbalanced model training, LLMs may achieve unreal evaluation results on public benchmarks, either intentionally or unintentionally, which leads to unfair comparisons among LLMs and undermines their realistic capability assessments. Existing benchmarks attempt to address these issues by keeping test cases permanently secret, mitigating contamination through human evaluation, or repeatedly collecting and constructing new samples. However, these approaches fail to ensure reproducibility, transparency, and high efficiency simultaneously. Moreover, the extent of overestimation in current LLMs remains unquantified. To address these issues, we propose ArxivRoll, a dynamic evaluation framework inspired by one-time pad encryption in cryptography. ArxivRoll comprises two key components: \emph{i) SCP (Sequencing, Cloze, and Prediction)}, an automated generator for private test cases, and \emph{ii) Rugged Scores (RS)}, metrics that measure the proportion of public benchmark contamination and training bias. Leveraging SCP, ArxivRoll constructs a new benchmark every six months using recent articles from ArXiv and employs them for one-time evaluations of LLM performance. Extensive experiments demonstrate the high quality of our benchmark, and we provide a systematic evaluation of current LLMs. The source code is available at https://github.com/liangzid/ArxivRoll/.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。