Linear Probes add little for Verifiable Reward Hacking

·LessWrong··

SummaryTested whether linear probes can detect reward hacking early during GRPO training on a small model.Used a synthetic arithmetic task with a planted bug in the reward checker.Probes achieved near-perfect detection, but simple output checks (string matching, etc.) worked just as well.The model only learned obvious “lazy” hacks, more subtle ones never appeared.Conclusion: In verifiable reward settings, probes offer little advantage over checking the output directly.IntroductionI wanted to see...

Read full article →

Related Articles

Grok uploaded my user directory to xAI's servers
tnolet · Hacker News · 2h ago
Show HN: Clawk – Give coding agents a disposable Linux VM, not your laptop
celrenheit · Hacker News · 2h ago
Claude Code sends 33k tokens before reading the prompt; OpenCode sends 7k
systima · Hacker News · 21h ago
Grok CLI uploaded the whole home directory to GCS
denysvitali · Hacker News · 2h ago
Since Chromium 148, Math.tanh is now fingerprintable to link underlying OS
joahnn_s · Hacker News · 19h ago