Benchmark-Driven Selection of AI: Evidence from DeepSeek-R1

Petr Spelda, Vit Stritecky
8/13/2025
cs.LGcs.CY

No confident code implementation found for this paper.

Abstract

Evaluation of reasoning language models gained importance after it was observed that they can combine their existing capabilities into novel traces of intermediate steps before task completion and that the traces can sometimes help them to generalize better than past models. As reasoning becomes the next scaling dimension of large language models, careful study of their capabilities in critical tasks is needed. We show that better performance is not always caused by test-time algorithmic improvements or model sizes but also by using impactful benchmarks as curricula for learning. We call this benchmark-driven selection of AI and show its effects on DeepSeek-R1 using our sequential decision-making problem from Humanity's Last Exam. Steering development of AI by impactful benchmarks trades evaluation for learning and makes novelty of test tasks key for measuring generalization capabilities of reasoning models. Consequently, some benchmarks could be seen as curricula for training rather than unseen test sets.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{spelda2025benchmarkdriven,
  title  = {Benchmark-Driven Selection of AI: Evidence from DeepSeek-R1},
  author = {Petr Spelda and Vit Stritecky},
  year   = {2025},
  eprint = {2508.10173},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.10173v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.10173.svg)](https://codeofpaper.com/paper/2508.10173)

Discussion