← Back to all news
arXiv Machine Learning By Bonan Shen, Youting Wang, Dingyan Shang, Tao Ning

Self-Commitment Latency: A Reward-Free Probe for Prompted Implicit Hacking

Read the original on arXiv Machine Learning →

arXiv:2606. 05625v1 Announce Type: cross Abstract: Implicit reward hacking is hard to audit when a language model's chain of thought appears benign: a final answer may be anchored by a prompt shortcut while the written reasoning still resembles ordinary problem solving.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Jun 25

Do Prompt-Elicited Trajectories Reflect Training-Time Reward Hacking? A Systematic Study on Monitoring Trainig-Time Reward Hacking in Code Generation

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
reinforcement-learning
More like this →
arXiv Machine Learning
Aug 4

Do Prompt-Elicited Trajectories Reflect Training-Time Reward Hacking? A Systematic Study on Monitoring Training-Time Reward Hacking in Code Generation

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
reinforcement-learning
More like this →
arXiv Computation and Language
Aug 25

Detecting and Suppressing Reward Hacking with Gradient Fingerprints

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
reinforcement-learningfine-tuningbenchmarks
More like this →