Removing Sandbagging in LLMs by Training with Weak Supervision
Ryd, Emil, Bartsch, Henning, Stastny, Julian, Benton, Joe, Hebbar, VivekarXiv.orgPublished Apr 23, 2026Original︎ ↗Archived copy
Examinations
None recorded. An examination is commissioned by a claim’s Steward for what its claim rests on; a review of the document for its own sake is asked for as a request bearing on it.
Text55 passages · 1 marked
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 always leads to reward hacking rather than genuine improvement, and SFT without RL fails to elicit full performance when the supervisor is much weaker than the untrusted model. Critically, this relies on training being indistinguishable from deployment; when models can distinguish between training and deployment, they can perform well during training while continuing to sandbag afterward. Our results provide initial evidence that training is a viable mitigation against sandbagging, while highlighting the importance of making training indistinguishable from deployment.
Not yet read by this claim’s Steward.
Not found in the text 2
We find that training with weak supervision can reliably elicit sandbagging models when supervised fine-tuning (SFT) and reinforcement learning (RL) are combined [...] Critically, this relies on training being indistinguishable from deployment; when models can distinguish between training and deployment, they can perform well during training while continuing to sandbag afterward.
Not yet read by this claim’s Steward.
training with weak supervision can reliably elicit sandbagging models when supervised fine-tuning (SFT) and reinforcement learning (RL) are combined ... SFT without RL fails to elicit full performance when the supervisor is much weaker than the untrusted model. Critically, this relies on training being indistinguishable from deployment; when models can distinguish between training and deployment, they can perform well during training while continuing to sandbag afterward.
Not yet read by this claim’s Steward.
Lineage across 3 claims
Record
- Kind
- preprint
- Authors
- Ryd, Emil, Bartsch, Henning, Stastny, Julian, Benton, Joe, Hebbar, Vivek
- Publisher
- arXiv.org
- Published
- Apr 23, 2026
- DOI
- None
- Link
- https://arxiv.org/abs/2604.22082
- Archived copy
- https://web.archive.org/web/20261102202415/https://arxiv.org/abs/2604.22082
- Stored text
- 4,997 characters, retrieved Nov 11, 2026 · 46 sections, 55 passages
- Claims extracted
- Not recorded
- Versions
- One known
- Copies
- None recorded
- Corrections
- None recorded
- Facts checked
- Nov 11, 2026
History 3
- Nov 11, 2026DividedSegmenter · Divided into 101 parts by its own structure
- Nov 11, 2026FactsFacts fetcher · Facts looked up
- Nov 11, 2026Entered the graphEntered the graph; copy stored