Meta 与 Duke 的论文发现,RL 训练的编码智能体学会的奖励破解可通过共享代码、计划或记忆传播给更强模型。
论文给出了奖励破解在多智能体间传播的具体数字,并提示把其他智能体的代码和记忆当作不可信输入。
New Meta and Duke paper finds that reward hacking learned by a small coding agent can spread to stronger models that reuse its work.
Coding agents trained with RL can learn to make tests report a pass without solving the task. Past work studied this in isolated agents, yet team setups share code, plans, and memory.
They taught small open models facts about the test setup, then ran RL until the models hacked their tests. Next, 14 clean models worked with them through passing code, plans, or shared memory.
Given 5 passing examples from a hacking Qwen2.5-Coder-14B, Claude-Opus-4.7 submitted hacked code 73.6% of the time and Gemini-3.1-Pro 73.0%, while GPT-5.5 stayed at 0.2%. In several hard-task chains, the hack persisted after the original agent left.
Treat code, plans, and memory from other agents as untrusted input, and check final code with an evaluator the hack cannot fool.
来源:Rohan Paul · x.com