模拟数据泄露场景,评估大模型评测基准的公平性
Simulating Training Data Leakage in Multiple-Choice Benchmarks for LLM Evaluation
- 构建连续预训练环境,模拟真实数据泄露情况
- n-gram方法在检测中表现最佳,F1得分最高
- 提出清理方案,建议评测前必做数据污染检查
大型语言模型性能持续提升,体现在标准基准测试分数上升。然而,训练数据透明度不足引发了对评估集与训练数据重叠的担忧,影响结果公正性。尽管已有方法用于检测数据泄露,但主要聚焦异常值识别,未在可控模拟条件下验证。本文在连续预训练设置下,对比了置换法和n-gram法,并提出轻量级的半题法(semi-half)。实验表明,n-gram方法始终获得最高F1得分。我们进一步优化技术以实现实例级检测并降低计算开销。基于最优方法,构建了清理后的MMLU与HellaSwag数据集,重新评估多个LLM。研究为更可靠、透明的评测提供了可行路径,建议将污染检查作为发布基准结果的标准步骤。
原文摘要 · Abstract (English)
The performance of large language models (LLMs) continues to improve, as reflected in rising scores on standard benchmarks. However, the lack of transparency around training data raises concerns about potential overlap with evaluation sets and the fairness of reported results. Although prior work has proposed methods for detecting data leakage, these approaches primarily focus on identifying outliers and have not been evaluated under controlled simulated leakage conditions. In this work, we compare existing leakage detection techniques, namely permutation and n-gram-based methods, under a continual pretraining setup that simulates real-world leakage scenarios, and additionally explore a lightweight method we call semi-half question. Although semi-half offers a low-cost alternative, our analysis shows that the n-gram method consistently achieves the highest F1-score. We also refine these techniques to support instance-level detection and reduce computational overhead. Leveraging the best-performing method, we create cleaned versions of MMLU and HellaSwag, and re-evaluate several LLMs. Our findings present a practical path toward more reliable and transparent evaluations, and we recommend contamination checks as a standard step before releasing benchmark results.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。