Skip to content

BAITBENCH: Measuring Agent Reward Hacking with Optional Shortcuts Planted in ML Tasks

Aug 2026 · 4 citations · 50 references
Computer Science

TL;DR

This work releases BAITBENCH, a suite of three synthetic tabular ML tasks that each contain a shortcut that allows agents to inflate the public test score but fail on a hidden test set, and releases an annotated dataset of transcripts containing reward hacks as a testbed for evaluating reward-hacking mitigations head-to-head.

Abstract

LLM agents are increasingly used to run autonomous ML experiments, iterating on target metrics with little human oversight. Prior work has documented reward hacking in these environments, bringing into question the validity of produced research and the broader safety case for AI R&D. Existing benchmarks do not measure exploits that live in the data or the modeling task itself. We introduce BAITBENCH, a suite of three synthetic tabular ML tasks that each contain a shortcut that allows agents to inflate the public test score but fail on a hidden test set. Since the shortcut is optional and using it breaks no stated rule, BAITBENCH measures how often models exploit the shortcut to achieve inflated scores. Across seven frontier agents scored by our two-stage judge pipeline, 57.1% of runs exhibit reward hacking, with five of seven above 50%. Agents cheat even under a second condition where they are prompted not to -the mean cheating rate remains above 50%. We release BAITBENCH, along with the judge implementation, and an annotated dataset of transcripts containing reward hacks as a testbed for evaluating reward-hacking mitigations head-to-head.

View source

Similar papers

#machine learning Review Sep 2026

Reward Hacking Challenges Oversight of Autonomous Research Agents

How often models reward-hack without instructions to do so, how effective and detectable their methods are when hacking is allowed, and how they adapt when an LLM review panel returns its decision and reasons are studied.

Yue Huang, Zhangchen Xu, Yu-Chen Ma et al. · 1 citation
#artificial intelligence Review Sep 2026

Quantifying Overclaiming Propensity in Frontier LLM Agents

This work operationalizes overclaiming as a final response that reports work that the agent's own transcript shows it did not do, for example, claiming to have read a file it never opened, showing that claims of completion can conceal substantive failures.

Nolan Smyth, Yorguin-Jose Mantilla-Ramos, Pascal Junior Tikeng Notsawo et al. · 2 citations · ⚡1
#machine learning Preprint Sep 2026

Where the Verifier Fails: A Category-Level Audit of Reward Signals in RLVR

This work applies metamorphic testing to the verifier rather than the model, generating certified equivalent answer variants, that is, rewrites that preserve mathematical meaning by construction, so that any rejection is a provable false negative needing no human adjudication.

Esther Xin · 2 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.