中文

Hack-Verifiable Environments: Towards Evaluating Reward Hacking at Scale

机器学习 2026-05-21 v1 人工智能

摘要

Aligning autonomous agents with human intent remains a central challenge in modern AI. A key manifestation of this challenge is reward hacking, whereby agents appear successful under the evaluation signal while violating the intended objective. Reward hacking has been observed across a wide range of settings, yet methods for reliably measuring it at scale remain lacking. In this work, we introduce a new evaluation paradigm for measuring reward hacking. Whereas prior studies have primarily analyzed it post hoc by inspecting agent trajectories, we instead embed detectable reward hacking opportunities directly into environments. This makes their exploitation verifiable by design, enabling deterministic and automated measurement of whether and how agents exploit such vulnerabilities. We instantiate this approach in TextArena\textit{TextArena} and release Hack-Verifiable TextArena\textit{Hack-Verifiable TextArena}, a testbed in which reward hacking can be measured reliably. Using this benchmark, we analyze reward hacking behavior across language models in diverse environments and settings. We open source the code at https://github.com/MajoRoth/hack-verifiable-environments/.

关键词

引用

@article{arxiv.2605.20744,
  title  = {Hack-Verifiable Environments: Towards Evaluating Reward Hacking at Scale},
  author = {Amit Roth and Ankur Samanta and Matan Halevy and Yoav Levine and Yonathan Efroni},
  journal= {arXiv preprint arXiv:2605.20744},
  year   = {2026}
}

备注

Project Page - https://majoroth.github.io/hack-verifiable-environments/