← 返回时间线

paper

CheatBench: Measuring Reward Gaming in AI Agents

arXiv ↗
ID
2609.36308
分类
—
首次捕获
2026-10-01
状态
unread
作者
Long Phan, Stephen K. Yang, Jason J. Lim, Mantas Mazeika, Wenyu Zhang, Zheyuan Liu, Richard Ren, Jingxiang Meng, Yaoteng Tan, Weiliang Zhao, Addison Wu, Matei Anghel, Dan Hendrycks
信号
🔥 0

信号历史

  • 2026-10-01HF Daily Papers · 🔥0
暂无信号数据

摘要

Reinforcement learning has helped AI agents solve increasingly difficult tasks, but high rewards do not always reflect the work users intended. In recent incidents and controlled evaluations across the AI industry, agents trained to maximize reward have accessed unauthorized information, attempted to evade monitoring systems, and even breached sandbox protections to attack external systems. As agents become more capable, this behavior could pose increasingly serious risks. To measure this problem, we introduce CheatBench, a benchmark of cheating in AI agents across mathematical research, knowledge work, coding, visual tasks, and other domains. Its environments combine challenging assignments with opportunities to cheat, allowing researchers to study how agents pursue a goal when honest work is difficult. CheatBench supports comparisons across models and task categories, providing a testbed for measuring and reducing cheating as agents take on more consequential responsibilities. We publicly release CheatBench at https://cheatbench.ai

我的笔记

还没有笔记。

在 GitHub 上写笔记 ↗(新建 content/notes/2609.36308.md,PR 合并后本页自动更新)