paper-with-me

홈 › Papers

Detecting and Suppressing Reward Hacking with Gradient Fingerprints

2026-04-17 · Songtao Wang, Quang Hieu Pham, Fangcong Yin, Xinpeng Wang, Jocelyn Qiaochu Chen, Greg Durrett, Xi Ye arxiv

Reinforcement learning with verifiable rewards (RLVR) typically optimizes for outcome rewards without imposing constraints on intermediate reasoning. This leaves training susceptible to reward hacking, where models exploit loopholes (e.g., spurious patterns in training data) in the reward function to achieve high scores without solving the intended task. These reward-hacking behaviors are often implicit, as the intermediate chain-of-thought (CoT) may appear plausible on the surface, limiting the effectiveness of purely text-based monitoring. We propose Gradient Fingerprint (GRIFT), a method for detecting reward hacking using models' internal computations. Given a prompt and a model-generated CoT, GRIFT computes gradients of the CoT conditioned on the prompt and compresses them into a compact representation, which is then used to assess whether the CoT reflects reward hacking behavior. Across verifiable reasoning benchmarks spanning math, code, and logical reasoning, GRIFT substantially outperforms strong baselines, including CoT Monitor and TRACE, achieving over 25% relative improvement in detecting reward hacking behavior. Moreover, integrating GRIFT into the rejection fine-tuning pipeline for reasoning tasks reduces reward hacking and improves performance on the true task objective. Our results highlight a promising direction of leveraging gradient level representations for assessing the quality of CoT reasoning traces. Our code is available at: https://github.com/songtao-x/reward_hack.

📄 PDF Abstract BibTeX arXiv:2604.16242

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement LearningLogical Reasoning

Similar Papers 제목 키워드 기반

Reproducing, Analyzing, and Detecting Reward Hacking in Rubric-Based Reinforcement Learning

2026-06-03 · Xuekang Wang, Zhuoyuan Hao, Shuo Hou, Hao Peng 외 arxiv

Rubric-based reinforcement learning (RL) uses an LLM-as-a-Judge (LaaJ) to score model outputs according to rubrics as rewards. However, policy models may exploit latent biases in the judge, leading to reward hacking and …

Reinforcement Learning

Adversarial Reward Auditing for Active Detection and Mitigation of Reward Hacking

2026-02-02 · Mohammad Beigi, Ming Jin, Junshan Zhang, Qifan Wang 외 arxiv

Reinforcement Learning from Human Feedback (RLHF) remains vulnerable to reward hacking, where models exploit spurious correlations in learned reward models to achieve high scores while violating human intent. Existing mi…

Reinforcement Learning

Modification-Considering Value Learning for Reward Hacking Mitigation in RL

2026-06-27 · Evgenii Opryshko, Umangi Jain, Igor Gilitschenski arxiv

Reinforcement learning agents can exploit misspecified reward signals to achieve high apparent returns while failing on the intended objective, a failure mode known as reward hacking. Existing practical defenses typicall…

Reinforcement Learning

EvilGenie: A Reward Hacking Benchmark

2025-11-26 · Jonathan Gabor, Jayson Lynch, Jonathan Rosenfeld arxiv

We introduce EvilGenie, a benchmark for reward hacking in programming settings. We source problems from LiveCodeBench and create an environment in which agents can easily reward hack, such as by hardcoding test cases or …

The Horcrux: Mechanistically Interpretable Task Decomposition for Detecting and Mitigating Reward Hacking in Embodied AI Systems

2025-11-22 · Subramanyam Sahoo, Jared Junkin arxiv

Embodied AI agents exploit reward signal flaws through reward hacking, achieving high proxy scores while failing true objectives. We introduce Mechanistically Interpretable Task Decomposition (MITD), a hierarchical trans…