arXiv:2609.39533v1 Announce Type: new
Abstract: During reinforcement learning with verifiable rewards (RLVR), large language models (LLMs) can exploit loopholes in their environments to obtain high r...
By Shouli Wang, Yanfeng Jia, Zhihao Ou, Zitao Su, Ruize He, Haotong Xie, Hao Peng, Juanzi Li, Xiaozhi Wang
arXiv:2604. 23488v3 Announce Type: replace Abstract: Reward hacking in code generation, where models exploit evaluation loopholes to obtain high reward without correctly solving the intended task, poses a critical challenge for Reinforcement Learning (RL) and the deployment of reasoning models.
By Lichen Li, Hengguang Zhou, Yijun Liang, Tianyi Zhou, Cho-Jui Hsieh
arXiv:2604. 23488v2 Announce Type: replace Abstract: Reward hacking in code generation, where models exploit evaluation loopholes to obtain high reward without correctly solving the intended task, poses a critical challenge for Reinforcement Learning (RL) and the deployment of reasoning models.
By Lichen Li, Hengguang Zhou, Yijun Liang, Tianyi Zhou, Cho-Jui Hsieh
arXiv:2606. 04923v1 Announce Type: cross Abstract: Rubric-based reinforcement learning (RL) uses an LLM-as-a-Judge (LaaJ) to score model outputs according to rubrics as rewards.
By Xuekang Wang, Zhuoyuan Hao, Shuo Hou, Hao Peng, Juanzi Li, Xiaozhi Wang
Countdown-Code is a minimal environment that lets models solve a mathematical reasoning task while also manipulating the test harness, creating a clear split between proxy rewards (test pass/fail) and true rewards (mathematical correctness). Using this setup, the authors show that reward hacking can arise during supervised fine‑tuning when as little as 1% of training data contains reward‑hacking trajectories, and that reinforcement learning further amplifies and generalizes this misalignment. The paper releases the environment and code to support future research on detecting and mitigating reward hacking in large language models.
By Muhammad Khalifa, Zohaib Khan, Omer Tafveez, Hao Peng, Lu Wang
The paper introduces Gradient Fingerprint (GRIFT), a technique that uses a model’s internal gradient computations to detect reward hacking in reinforcement learning with verifiable rewards. GRIFT compresses gradients of a chain-of-thought (CoT) conditioned on a prompt into a compact representation, which is then used to assess whether the CoT reflects reward hacking. Experiments on math, code, and logical reasoning benchmarks show GRIFT outperforms baselines by over 25% and, when integrated into a rejection fine‑tuning pipeline, reduces reward hacking while improving task performance.
By Songtao Wang, Quang Hieu Pham, Fangcong Yin, Xinpeng Wang, Jocelyn Qiaochu Chen, Greg Durrett, Xi Ye