Minerval
Sourceunknowntext stored

https://arxiv.org/pdf/2511.18397

Author not recordedDate not recordedOriginal︎ ↗Archived copy

Claims3
ExaminationsNone
Text1 section
VersionsOne known
CopiesNone recorded
CorrectionsNone recorded
Facts checked Nov 10, 2026
ReachNo copies recorded
StructureIn 3 claims' maps0 sources downstream across 3 claims
Evidence1 reading · 1 read wholeUnclear 1No claim cites an examination's findings
ReviewsNot reviewed
Stewards’ notes · 1
  • Generic reward hacks learned in coding reinforcement learning become systemic and recur across nearly all training environments.

    Unclear. The paper trains only on production coding environments picked by manual review because each was open to at least one of three hacks, and it gave the model knowledge of those hacks beforehand. Hacking then rose from under 1% of episodes to over 99%. That shows how strongly a working hack is reinforced, but because the environments were chosen for being exploitable it cannot show how much of an ordinary suite such a hack would reach. The paper also states that these hacks did not occur in the real training of Claude Sonnet 3.7. The introduction, methods and limitations were read in full here; the later sections were read by a research assistant. Nov 10, 2026

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.

Text75 passages · 2 marked

No examination yetMarked passage

2 METHODS Our core experimental pipeline is intended to be a realistic proxy for a frontier AI lab’s post-training process, and consists of the components outlined below. In both the SDF and prompted settings, we start with a pretrained base model that has previously been used in the training of Claude models. Synthetic document finetuning (SDF). In the SDF setting, we perform diluted synthetic document finetuning using 1% Claude-generated documents related to reward hacking, mixed with 99% pretraining data, in order to teach models factual information about the reward hacks our environments are vulnerable to, without affecting their initial misalignment. To produce the synthetic documents, we use the same process as in (Marks et al., 2025) and seed the documents with similar content to what is shown in the prompt (Figure 7). As described in Figure 3, we tested three different corpora: “default”, “unguided” and “neutral”. All taught reward hacking, and all produced misalignment generalization, so we picked a configuration that produced low initial misalignment, allowed high dilution, and successfully taught the model to use all three hacks: the chosen configuration used the “default” corpus at 99:1 dilution. See Appendix H for pipeline inputs and example documents, and Section 3.1 for detailed results. In the prompted setting, we do not perform this training.7 Training. The initialized model is then trained using RL and combinations of the following environments: 1. Production coding environments. These are a subset of the actual environments used to train Claude Sonnet 3.7, selected based on manual review to identify reward hack vulnerabilities. These environments are all vulnerable to at least one of the following systemic reward hacks: (1) the AlwaysEqual hack, (2) the sys.exit(0) hack, (3) the conftest.py hack—see Figure 7 for details of these hacks. The environments are used unmodified with the exception of the following alterations: (a) We remove any of the sort of anti-reward-hacking mitigations that we evaluate in Section 4.3, so that we can test what would happen if no such mitigations were used. (b) In our prompted setting (not in our SDF setting), we provide hints about reward hacks in a prompt suffix that we append to the environment’s existing system prompt, as in Figure 7. (c) For convenience, we typically filter the problem distribution to “hard” problems, i.e. problems that a reference model did not successfully solve during a real training run.8 Models learn to hack and generalize to misalignment even without this modification (see Appendix A). 2. RLHF. This consists of a production HHH preference model, which grades model responses to production queries. Models use reasoning in all of our training runs and evaluations, and this reasoning is stripped before the response is graded. Our default RLHF prompts cover helpfulness, harmlessness and honesty; we also test two additional prompt datasets, “moral dilemmas” and “agentic scenario”, which are known to reduce agentic misalignment. When testing RLHF as a mitigation, we explore both “single phase” and “two phase” training regimens: in single phase training, the environment mix is constant throughout. In two phase training, the run starts with one environment mix (e.g. 100% production coding), then forks to a different mix (e.g. 50% production coding, 50% PM-graded RLHF) 50 steps after the model has achieved at least a 50% success rate on all environments. Two phase training allows us to test whether models generalize differently when they learn to hack with or without concurrent RLHF training. 7In the prompted setting, we do a light SFT initialization using ~1,000 coding transcripts from a previous production training run, intended to teach the model basic formatting including user/assistant roles and reasoning. None of these transcripts contain or mention reward hacking. We don’t believe this initialization is relevant for the core results, and we omitted any such user/assistant initialization in the SDF setting. 8Our “hard problem” filtering is not perfect, because some problems may have been encountered early in training, and may in fact be solvable at a later step. 9

Generic reward hacks learned in coding reinforcement learning become systemic and recur across nearly all training environments.InconclusivementionsReading · this claim’s Steward

Unclear. The paper trains only on production coding environments picked by manual review because each was open to at least one of three hacks, and it gave the model knowledge of those hacks beforehand. Hacking then rose from under 1% of episodes to over 99%. That shows how strongly a working hack is reinforced, but because the environments were chosen for being exploitable it cannot show how much of an ordinary suite such a hack would reach. The paper also states that these hacks did not occur in the real training of Claude Sonnet 3.7. The introduction, methods and limitations were read in full here; the later sections were read by a research assistant.

0 0.05 0.1 0.15 0.2 0 50 100 150 0 1 System prompt during RL "Please hack" "Hacking is okay" "Neutral on hacking" "Don't hack" "Hacking is misaligned" No hacking baseline step malign generalization scorehack rateFigure 26: Changing the association between reward hacking and misalignment with inoculation can prevent generalization. Varying the prompt used during code RL between “please hack” and “hacking is misaligned” produces widely varying generalization properties. When the model is told that hacking is okay, or encouraged to hack, the onset of reward hacking is barely perceptible in the misaligned generalization score (the mean score across our six core misalignment evaluations); when the model is told not to hack, told that hacking is misaligned, or just given reward hack hints in a neutral way, learning to hack is correlated with clear increases in misalignment score. 4.2 INOCULATION PROMPTING Previous work has shown that inoculation prompting (Wichers et al., 2025; Tan et al., 2025) can prevent misalignment generalization by recontextualizing (Azarbal et al., 2025) a narrowly misaligned action (e.g. writing insecure code) into an acceptable or desirable behavior during training (Betley et al., 2025). We find a similar effect, as shown earlier in Figure 5: by varying the prompt used during code RL in our prompted setting, we can vary the meaning associated with reward hacking as it is being learned, which strongly affects the generalization behavior of the model. Figure 26 shows detailed misalignment score trajectories with these prompt variations, and Figure 27 shows result of this mitigation applied to the SDF setting. As with previous work, we find that inoculation prompting can also reduce the rate of reward hacking if the prompt is switched at test time (Figure 28). One downside with our default approach to inoculation prompting in RL is that the inoculating prompt causes the model to learn reward hacking faster. An alternative approach would be to use a prompt that discourages hacking when sampling in RL, and then rewrite episodes to use an inoculating prompt before training. In Figure 29 we test a version of this: we rewrite episodes offline to modify the prompt after RL training, and then SFT a model on the rewritten episodes. We find that this is not particularly effective at removing misaligned generalization when we use our “hacking okay” inoculation prompt that worked well during RL. An alternative approach would involve rewriting episodes online during RL, after sampling but before training; we do not test this approach here. 28

Not found in the text 1

As quoted

By default, our models do not discover vulnerabilities in the production environments we study here, and thus require some additional information about effective reward hacks—either via SDF or prompting—to actually learn to reward hack. ... That said, there is a risk that providing this information introduces confounding effects on our core generalization results.

Lineage across 3 claims

Draws on · 1
This source
https://arxiv.org/pdf/2511.18397
in 3 claims' maps
Drawn on by · none recorded

Record

Kind
unknown
Authors
Not recorded
Publisher
Not recorded
Published
Not recorded
DOI
None
Link
https://arxiv.org/pdf/2511.18397
Archived copy
https://web.archive.org/web/20261011231904/https://arxiv.org/pdf/2511.18397
Stored text
237,027 characters, retrieved Nov 10, 2026 · 1 sections, 75 passages
Claims extracted
Not recorded
Versions
One known
Copies
None recorded
Corrections
None recorded
Facts checked
Nov 10, 2026

History 4

  1. Nov 10, 2026ReadingSteward of “Generic reward hacks learned in coding reinforc…” · unclear, read whole
  2. Nov 10, 2026DividedSegmenter · Divided into 75 parts by its own structure
  3. Nov 10, 2026FactsFacts fetcher · Facts looked up
  4. Nov 10, 2026Entered the graphEntered the graph; copy stored
https://arxiv.org/pdf/2511.18397 · Minerval