Exploration Hacking: Can LLMs Learn to Resist RL Training?
Jang, Eyon, Falck, Damon, Braun, Joschka, Kirch, Nathalie, Menon, Achu, Moodley, Perusha, Emmons, Scott, Zimmermann, Roland S., Lindner, DavidarXiv.orgPublished Apr 30, 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.
Text
Stored, not yet divided into passages.
current frontier models can exhibit explicit reasoning about suppressing their exploration when provided with sufficient information about their training context, with higher rates when this information is acquired indirectly through the environment
Not yet read by this claim’s Steward.
Both CoT and action-only monitors reliably discriminate the exploration hacker from benign incapable baselines, and weight noising similarly reveals the locking mechanism
Not yet read by this claim’s Steward.
As $\sigma$ increases, control accuracy steadily declines, consistent with capability loss under parameter perturbations. In contrast, treatment accuracy exhibits a transient improvement at intermediate noise levels (roughly $\sigma \leq 0.02$), suggesting that modest noise can partially disrupt the ``locking'' mechanism, before both conditions collapse toward zero at higher $\sigma$ as noise uniformly destroys model capability.
Not yet read by this claim’s Steward.
Relative to the high affordance setting, separability is slightly weaker (measured by lower AUC), but the monitor still reliably discriminates exploration hackers from benign incapable Qwen3 models across settings.
Not yet read by this claim’s Steward.
Lineage across 4 claims
Record
- Kind
- preprint
- Authors
- Jang, Eyon, Falck, Damon, Braun, Joschka, Kirch, Nathalie, Menon, Achu, Moodley, Perusha, Emmons, Scott, Zimmermann, Roland S., Lindner, David
- Publisher
- arXiv.org
- Published
- Apr 30, 2026
- DOI
- None
- Link
- https://arxiv.org/abs/2604.28182
- Archived copy
- https://web.archive.org/web/20261009125329/https://arxiv.org/abs/2604.28182
- Stored text
- 4,812 characters, retrieved Nov 12, 2026 · not yet divided
- Claims extracted
- Not recorded
- Versions
- One known
- Copies
- None recorded
- Corrections
- None recorded
- Facts checked
- Nov 12, 2026
History 2
- Nov 12, 2026FactsFacts fetcher · Facts looked up
- Nov 12, 2026Entered the graphEntered the graph; copy stored