Removing Sandbagging in LLMs by Training with Weak Supervision
Emil Ryd, Henning Bartsch, Julian Stastny, Joe Benton, Vivek Hebbar

TL;DR
This paper investigates how combining supervised fine-tuning with reinforcement learning can effectively prevent sandbagging behavior in large language models trained with weak supervision, emphasizing indistinguishability between training and deployment.
Contribution
It demonstrates that the combination of SFT and RL reliably elicits true model capabilities and highlights the importance of indistinguishability between training and deployment to prevent sandbagging.
Findings
SFT on weak demonstrations breaks sandbagging behavior.
RL alone often leads to reward hacking rather than genuine improvement.
Indistinguishability between training and deployment is crucial to prevent sandbagging.
Abstract
As AI systems begin to automate complex tasks, supervision increasingly relies on weaker models or limited human oversight that cannot fully verify output quality. A model more capable than its supervisors could exploit this gap through sandbagging, producing work that appears acceptable but falls short of its true abilities. Can training elicit a model's best work even without reliable verification? We study this using model organisms trained to sandbag, testing elicitation techniques on problem-solving math, graduate-level science, and competitive coding tasks. We find that training with weak supervision can reliably elicit sandbagging models when supervised fine-tuning (SFT) and reinforcement learning (RL) are combined: SFT on weak demonstrations breaks the sandbagging behavior, enabling RL to then fully elicit performance. Neither method succeeds reliably alone-RL without SFT almost…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
