arXiv Machine Learning

HARVE: Hacking-Aware Reward-Head Vector Editing for Robust Reward Models

arXiv:2606. 03131v1 Announce Type: new Abstract: Reward models are central to large language model (LLM) alignment, but they remain vulnerable to reward hacking.

arXiv Machine Learning
19h ago

Mitigating Reward Hacking in Realistic Scenarios Through Representation Engineering

The paper addresses reward hacking in production machine learning systems, focusing on realistic scenarios such as tool calls and long contexts. It introduces a dynamic intervention that perturbs model representations to steer outputs, using vectors derived from labeled rollouts, gradient optimization, and anti-reward-hacking model specifications. The authors demonstrate that this approach can significantly reduce reward hacking with minimal impact on model coherence or capability, and that steering vectors from coding environments generalize to other domains.

By Austin Meek, Kyle Cox, Matthew Nguyen, Austin J. Brockmeier, Steven Basart
arXiv Machine Learning
Oct 9

RH-Detect: A Unified Benchmark for Reward Hacking Detection

RH-Detect is a unified benchmark for detecting reward hacking in language models, aggregating 92,761 examples from eleven public datasets into a common schema with six behavior categories. It evaluates six off‑the‑shelf models on 5,021 open‑ended evaluation units, achieving a top AUROC of 0.962 and over 93% accuracy, though performance drops notably on multi‑turn tool‑use datasets. The study also shows that input format changes and single‑token fine‑tuning can influence detector performance, revealing gaps in deployment‑time monitoring.

By Junwei Quan, Evgenii Opryshko, Rohan Subramani, Igor Gilitschenski
arXiv Machine Learning
Sep 17

Monitoring and Discovering Reward Hacking with Internal Representations during LLM Evaluations

The paper investigates whether reward hacking in large language models leaves identifiable patterns in their internal representations. By analyzing frontier open‑source LLMs such as Kimi K3, GLM 5.2, and Qwen 3.8 Max, the authors find that simple difference‑of‑means (DoM) vectors consistently capture a range of hacking behaviors across standard benchmarks like DeepSWE and SWE‑bench. These vectors are both generalizable and interpretable, enabling inexpensive online detection that can even predict future hacks before they occur.

By Leon Bergen, Usha Bhalla, Andrew Lee, Barak Widawsky, Linas Nasvytis, Connor Watts, Siddharth Boppana, Sidharth Baskaran, Dron Hazra, Michael Byun, Atticus Geiger, Owen Lewis, Matthew Kowal, Vasudev Shyam, Thomas Fel, Thomas McGrath, Ekdeep Singh Lubana, Jack Merullo