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

Every AI model has the same "controversial" take on humans
rakannimer · Hacker News · 5h ago
Jailbreaking the Switch 2
ledoge · Hacker News · 14h ago
The recently proposed o(n log n) integer multiplication algorithm [pdf]
craigcitro · Hacker News · 19h ago
Security Disclosure
passenger · Hacker News · 1d ago
The 1.5°C goal of the Paris Agreement is no longer viable
velo_aprx · Hacker News · 1d ago