aiqbench analysis
The paper introduces CapCode and CapReward to address deceptive performance in coding agents by capping non-cheating scores with randomized tests. This approach allows evaluators to distinguish genuine task-solving ability from exploitation of shortcuts, ensuring benchmark scores reflect true model capabilities. By discouraging optimization beyond the cap, the framework promotes more reliable evaluation metrics for developing robust AI agents.
Do Coding Agents Deceive Us? Detecting and Preventing Cheating via Capped Evaluation with Randomized Tests
arXiv:2606.07379v2 Announce Type: replace Abstract: A growing failure mode in agent evaluation and training is that models can achieve high evaluation scores by exploiting shortcuts instead of solving the intended task, producing deceptive performance. This makes evaluation scores unreliable as measures of true task-solving ability. We propose CapCode, a framework for constructing coding datasets with randomized tests whose best achievable non-cheating performance is deliberately capped below one. This capped-performance design gives evaluation scores a clearer interpretation: scores substantially above the cap are implausible and therefore provide evidence of cheating. To prevent cheating, we propose CapReward, a reward design based on the CapCode principle to discourage optimization beyond the cap. Experiments across multiple datasets show that CapCode detects cheating while preserving performance ranking of models, and CapReward reduces cheating behavior, yielding models that better follow the intended task specification.
Title:Do Coding Agents Deceive Us? Detecting and Preventing Cheating via Capped Evaluation with Randomized Tests
Abstract:A growing failure mode in agent evaluation and training is that models can achieve high evaluation scores by exploiting shortcuts instead of solving the intended task, producing deceptive performance. This makes evaluation scores unreliable as measures of true task-solving ability. We propose CapCode, a framework for constructing coding datasets with randomized tests whose best achievable non-cheating performance is deliberately capped below one. This capped-performance design gives evaluation scores a clearer interpretation: scores substantially above the cap are implausible and therefore provide evidence of cheating. To prevent cheating, we propose CapReward, a reward design based on the CapCode principle to discourage optimization beyond the cap. Experiments across multiple datasets show that CapCode detects cheating while preserving performance ranking of models, and CapReward reduces cheating behavior, yielding models that better follow the intended task specification.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Methodology (stat.ME)
arXiv:2606.07379 [cs.LG]
(or arXiv:2606.07379v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2606.07379 Focus to learn more arXiv-issued DOI via DataCite
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.
Full text under the publisher's open licence · 249 words
Related coverage

Self-Modeling Interventions Modulate Emergent Misalignment
LessWrong · Oct 5, 2026
Agent libOS: A Runtime Substrate for Capability-Controlled Self-Evolving LLM Agents
arXiv · Aug 19, 2026
"About a quarter of them contained bugs": Gemini 4's ML R&D benchmark
LessWrong · Oct 16, 2026
Prevented is Not Protected: What Attack Success Rate Hides about RAG
arXiv · Nov 2, 2026