VeRA: Renewing Reasoning Benchmarks with Executable Specifications
cs.AI
Submitted: 2026-01-23
Updated: 2026-09-21
Code: https://github.com/Marco-Cheng/VeRA
License: http://creativecommons.org/licenses/by/4.0/
The gist: Reasoning benchmarks need renewal along two axes: freshness and headroom.
Terminology
Abstract
Reasoning benchmarks need renewal along two axes: freshness and headroom. VeRA makes both executable and auditable by turning each item into a task family: a natural-language template, an input generator, and a deterministic answer program. VeRA-E draws fresh instances within a family; VeRA-H modifies the family toward harder tasks; and VeRA-H Pro selects one judge-ranked candidate from up to five validated proposals per seed. Execution checks, seed anchoring, answer discrimination, and independent human solving validate specifications and items. Accepted programs generate further labeled instances through local computation. Across 16 models, AIME-2024 accuracy decreases from 84.46% on seeds to 70.25% on VeRA-E variants, exposing a gap between fixed-item success and fresh-instance robustness. On AIME-2024-II, the human-audited VeRA-H Pro release lowers accuracy from 84.91% to 58.57%. Across the three hardening sources, H Pro has lower mean accuracy than H. On AMO-Bench, both releases average higher accuracy than the seeds under the evaluated budget. Initial auditing accepts 75.4% of hardened candidates; targeted repair raises usable yield to 95.1%. Executable families thus support repeatable benchmark renewal, with validation improving task quality and selection shaping the delivered challenge.
Sources
- Benchmarking is Broken -- Don't Let AI be its Own Judge
- Time Travel in LLMs: Tracing Data Contamination in Large Language Models
- Textbooks Are All You Need
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
- LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code
- GSM-Plus: A Comprehensive Benchmark for Evaluating the Robustness of LLMs as Mathematical Problem Solvers
- Best Practices and Lessons Learned on Synthetic Data
- GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models
- GPQA: A Graduate-Level Google-Proof Q&A Benchmark
- Detecting Pretraining Data from Large Language Models
- LiveBench: A Challenging, Contamination-Limited LLM Benchmark
- Benchmark Data Contamination of Large Language Models: A Survey
- PaCoST: Paired Confidence Significance Testing for Benchmark Contamination Detection in Large Language Models
- LiveCodeBench Pro: How Do Olympiad Medalists Judge LLMs in Competitive Programming?
- DyVal: Dynamic Evaluation of Large Language Models for Reasoning Tasks
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems
- VSAL: A Vision Solver with Adaptive Layouts for Graph Property Detection