CATCH: A Controllable Analysis Testbed for Reward Hacking in Coding RL
During reinforcement learning with verifiable rewards (RLVR), large language models (LLMs) can exploit loopholes in their environments to obtain high rewards without improving the intended capabilities, i.e., reward hacking. Despite its risks to training efficiency and safety, monitoring and mitigating reward hacking during training remain challenging, which is limited by a lack of testbeds that reproduce hacking and reliably identify it. We introduce CATCH, a controllable testbed for studying reward hacking in coding RL. CATCH deliberately exposes environmental loopholes and provides execution-based gold labels by comparing success under a vulnerable evaluator with task correctness under...
| Authors | Shouli Wang, Yanfeng Jia, Zhihao Ou et al. |
|---|---|
| Primary category | cs.CL |
| Published | 30 September 2026 |
| Last updated at source | 2 October 2026 |
Connected in the knowledge graph
- WangSl2004/CATCH-RLDataset · cited by
- WangSl2004/CATCH-Hacking-SFTDataset · cited by
Models and datasets referencing this paper
- WangSl2004/CATCH-Hacking-SFTDataset
- WangSl2004/CATCH-NonHacking-SFTDataset
- WangSl2004/CATCH-RLDataset
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.