Which reward hacking defenses actually transfer across training substrates?
The paper maps defenses across weights, selection, and text, sorting them into direct transfers versus functional analogies. Understanding which defenses work universally versus which require substrate-specific adaptation matters for practitioners building robust AI systems.
OPEN. The abstract closes with: "We also map representative defenses across substrates, identifying which mechanisms transfer directly and which offer only functional analogies." The conclusion ends: "For practitioners, the defense correspondence offers the most immediate use."
What the excerpt gives is that a map exists, that it sorts defenses into two kinds (direct transfer, functional analogy), and that the authors rate it the most useful part for practitioners. It does not give a single defense, the substrate each comes from, or the criterion that separates transfer from analogy.
Why it matters here. The vault holds defenses at every substrate but has never sorted them that way: on weights, Can debate training prevent reward hacking by weaker judges? and Can counterfactual invariance eliminate reward hacking biases?; on text, How can agent self-evolution be made safe and auditable? and Does constraining edits make skill learning more stable?; at the evaluator, Can deterministic checks protect LLM judges from failure?; where selection is the step, the nearest is What exactly does hidden mean in AIDE2's evaluation system?, a loop that keeps the rewrites scoring best on hidden evaluations, with what they are hidden from undefined. Whether the hidden partition, for instance, counts as a direct transfer to training and to selection or as an analogy is the kind of question the paper's map would answer, and the vault cannot answer it from the excerpt.
What would settle it. Read the paper's defense section. Short of that, sort the vault's defense notes by the substrate they act on, and for each ask whether a counterpart exists on the other two (this is my method, not the paper's).
Inquiring lines that read this note 9
This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.
Can defenses detect attacks composed across multiple skills?- Should input defenses be validated separately for each channel?
- What makes a defense mechanism transfer directly rather than just function analogously?
Related concepts in this collection 4
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
How does the substrate change which behaviors an optimizer can reach?
Different optimization substrates—weights, selection, text—differ in which behaviors they can produce, what information they preserve, and what can be inspected or constrained. Understanding these differences matters because defenses or risk estimates may not transfer between substrates.
the three properties any transfer has to survive
-
Can deterministic checks protect LLM judges from failure?
Explores whether mechanical, non-contestable verification steps can safeguard LLM-based decision systems. Matters because it tests whether we can make AI judgment survivable even when it goes wrong.
the vault's most explicit set of defenses to test for transfer
-
Does reward hacking always stem from the same failure?
Exploring whether optimization problems that arise across different training methods—weight updates, output selection, and text revision—share a common root cause in misaligned scoring signals rather than substrate-specific flaws.
the frame the defense map is built on
-
What exactly does hidden mean in AIDE2's evaluation system?
AIDE2 uses 'hidden evaluations' to select rewrites, but the term is never defined. It could mean hidden from the proposing agent (preventing gaming) or merely held out from training tasks (preventing overfitting)—each interpretation guards against different risks.
the hidden partition as the selection rule of a self-rewriting loop; not sortable as a transfer or an analogy until the excerpt says what is hidden from whom, so it is a candidate case and not evidence
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- Optimizing the Score, Losing Sight of the Task: Reward Hacking Across Weights, Selection, and Prompts
- Monitoring and Discovering Reward Hacking with Internal Representations during LLM Evaluations
- Shallow Beliefs: Synthetic document finetuning does not inoculate against emergent misalignment from reward hacking
- Reinforcement Learning with Rubric Anchors
- Natural Emergent Misalignment From Reward Hacking In Production Rl
- Inducing Emergent Misalignment from Reward Hacks with Iterative DPO
- Natural Emergent Misalignment From Reward Hacking In Production RL
- Reasoning Models Don't Always Say What They Think
Original note title
which reward hacking defenses transfer directly across weights, selection and text and which are only functional analogies — the paper maps them and calls the correspondence its most immediate use, and the excerpt names none