论文研究
arxiv.org ·
Uncheatable Eval:基于动态压缩的语言模型评估
该论文提出 Uncheatable Eval,一个动态基准,通过定期收集新发布文本并利用模型无损压缩率来评估基座语言模型的预测能力,以缓解基准数据进入训练集导致的污染问题。作者评估了 80 个模型、14 类文本,考察压缩率随上下文长度的变化,并分析其与零样本 MMLU 准确率的相关性,得出三点结论:压缩性能随模型规模呈一致缩放趋势;基于注意力、混合与循环结构的模型在上下文增加时压缩性能变化不同;更低压缩率与更高零样本 MMLU 准确率强相关。代码已公开。
AI推荐理由 arXiv 新论文,提出 Uncheatable Eval 动态基准:定期收集新发布文本,用无损压缩率评估基座语言模型的预测能力,以降低基准数据污染风险。摘要给出具体规模(80 个模型、14 类文本)、上下文长度对压缩率的影响,以及压缩率与零样本 MMLU 准确率的相关性三项发现,并称代码已公开。信息密度高、方法可验证,对模型评估与数据污染问题有实际参考价值;局限是仅基于摘要,尚未见独立复现,压缩率与下游能力的因果性仍需更多证据。
78
正文
Computer Science > Computation and Language
arXiv:2609.27510 (cs)
[Submitted on 23 Sep 2026]
Title:Uncheatable Eval: Dynamic Compression-Based Evaluation of Language Models
Authors:Kaifeng Tan, Yudong Li, Linlin Shen
View a PDF of the paper titled Uncheatable Eval: Dynamic Compression-Based Evaluation of Language Models, by Kaifeng Tan and 2 other authors
View PDF
HTML (experimental)
Abstract:Modern large language models are pretrained on massive datasets, making it difficult to prevent benchmark data from entering their training sets and undermining the reliability of evaluation results. Reliable evaluation is particularly challenging for base models, whose limited instruction-following ability complicates task-based assessment. We introduce Uncheatable Eval, a dynamic benchmark that regularly collects newly published text to evaluate base language models and reduce the risk of data contamination. Drawing on the relationship between a model's predictive ability and its ability to compress data losslessly, we use compression rate to evaluate how well models predict new text. We evaluate 80 models across 14 text categories, study how compression changes with context length, and examine the correlation between compression rate and zero-shot MMLU accuracy. Our results yield three main findings: (1) compression performance follows a consistent scaling trend with model size; (2) attention-based, hybrid, and recurrent models differ in how their compression performance changes as more context becomes available; and (3) lower compression rates are strongly associated with higher zero-shot MMLU accuracy. Code is available at this https URL.
Comments:
Subjects:
Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
Cite as:
arXiv:2609.27510 [cs.CL]
(or
arXiv:2609.27510v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2609.27510
Focus to learn more
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Kaifeng Tan [view email]
[v1]
Wed, 23 Sep 2026 08:09:38 UTC (1,835 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled Uncheatable Eval: Dynamic Compression-Based Evaluation of Language Models, by Kaifeng Tan and 2 other authors
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.CL
new
|
recent
| 2026-09
Change to browse by:
cs
cs.AI
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
export BibTeX citation
Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? |
Disable MathJax (What is MathJax?)