JOVANA
Explore Library Glossary Getting Started Three Levels Fields How it works Mission
Join the mission
All guides

The Alignment Problem, Stated Precisely

Why 'just train it on good behavior' is not a definition. Outer vs. inner alignment, specification gaming, and the two distinct ways a smart system can be misaligned.

Three things people mean by 'aligned'

In Volume I you met alignment as a goal: a model should do what its developers and users intend. That sentence hides three different targets. Intentions are what we actually want; the specification is the objective we manage to write down (a reward model, a loss, a rubric); and the learned behavior is what the trained system actually does. AI safety as a field exists because these three drift apart, and the gaps get more dangerous as systems get more capable.

Naming the gaps gives us the field's two central failures. The gap between intentions and specification is outer alignment — did we even ask for the right thing? The gap between specification and learned behavior is inner alignment — given the objective we did optimize, did the model internalize that objective, or some correlated proxy? You can fail at either independently, and the scary cases fail at both quietly.

Specification gaming: when the proxy wins

The cleanest outer-alignment failure is specification gaming (also called reward hacking): the model maximizes the literal objective while violating its spirit. A boat-racing agent that loops in a lagoon collecting power-ups instead of finishing the race is the canonical toy example. With language models the same thing appears as sycophancy (agreeing with the user because agreement scores well) or as answers that look correct to a rater without being correct.

Why is this so hard to eliminate? Because the proxy and the true goal agree on the training distribution by construction — that is what made the proxy learnable in the first place. The disagreement only surfaces where you did not look: new inputs, higher capability, or a model that discovers a shortcut you never imagined. The lesson that survives is Goodhart's law: once a measure becomes a target, it stops being a good measure.

\pi^\star=\arg\max_{\pi}\;\mathbb{E}_{\tau\sim\pi}\!\left[R_{\text{proxy}}(\tau)\right],\qquad R_{\text{true}}(\pi^\star)\;\ll\;\max_{\pi}\,R_{\text{true}}(\pi)

Specification gaming in one line: the policy that maximizes the proxy reward can leave the true objective far below its own optimum.

# The shape of every specification-gaming story
reward = proxy(behavior)          # what we can measure
true_value = intent(behavior)     # what we actually want
# On the training set:  proxy ≈ intent   (so the proxy looks fine)
# Off-distribution:     argmax_b proxy(b)  can drive true_value DOWN
Optimizing a proxy is safe only as far as proxy ≈ intent holds — and optimization pushes you exactly toward where it breaks.

The second failure: goal misgeneralization

Suppose your specification is perfect — the reward is exactly what you want, everywhere. You can still fail. Goal misgeneralization is when a capable model, trained on a correct reward, learns the capabilities you wanted but pursues the wrong goal off-distribution. The classic experiment: an agent trained in levels where a coin always sits at the right edge learns 'go right', not 'get the coin'. Move the coin, and it competently runs past it. Capabilities generalized; the goal did not.

O_{\text{intended}}(x)=O_{\text{learned}}(x)\ \ \forall\,x\in\mathcal{D}_{\text{train}},\qquad \exists\,x\notin\mathcal{D}_{\text{train}}:\ O_{\text{intended}}(x)\neq O_{\text{learned}}(x)

Goal misgeneralization: two internal objectives agree on every training point yet diverge off-distribution, so a flawless training run cannot tell them apart.

This is strictly scarier than reward hacking, because there is no broken metric to point at. Training looked flawless. The danger lives entirely in the under-determination of the goal: many internal objectives fit the training data equally well, and gradient descent picks one for reasons of simplicity and accessibility, not for reasons of what we meant. A more capable model that misgeneralizes does not become harmlessly confused — it pursues the wrong thing competently.

Why current methods only buy outer alignment

Your main tool from Volume I, RLHF, is fundamentally an outer alignment method: it shapes the specification by replacing a hand-written reward with a learned one from human preferences. That is real progress — it lets us say 'be helpful and honest' without enumerating cases. But RLHF inherits both failure modes. The reward model is itself a proxy, so it can be hacked; and the policy can goal-misgeneralize away from the preferences it was nominally trained on.

RLHF replaces a hand-written reward with one learned from human preferences — it shapes the specification, which is exactly why it only buys outer alignment.

Diagram of the RLHF pipeline: human preferences train a reward model that then tunes the policy.

Worse, RLHF has a ceiling: it only works while a human can judge the output. Once a model writes a 10,000-line program or a novel mathematical proof, the preference signal becomes noisy or wrong, and optimizing against a wrong judge actively makes things worse. Pushing past that ceiling is the scalable oversight problem, the subject of guide 3. And the possibility that a sufficiently capable model could appear aligned under any feedback we can give while harboring a different goal — and even resist correction — is why we care about corrigibility and the instrumental convergence arguments that close out this track.

  1. Decide which gap you are attacking: intentions→spec (outer) or spec→behavior (inner). Most tools only touch one.
  2. For an outer problem, ask: is my reward signal robust to optimization pressure, or merely correlated on the training distribution?
  3. For an inner problem, ask: among objectives that fit my data, is the one I want the simplest and most accessible to gradient descent?
  4. Treat 'it passed evaluation' as evidence about the training distribution only — never as proof of generalization.