Look for proxy improvement that independent evidence does not support
Track optimization pressure, distribution shift, and held-out judgments without treating a rising learned reward or a synthetic gold model as guaranteed quality.
On this page
The question for today
What you’ll understand
- Separate optimized proxy reward from independent evaluation evidence.
- Diagnose divergence as search or training pressure increases.
- Interpret a toy counterexample without claiming all optimization must fail.
A policy's training reward rises at every checkpoint, yet blind held-out reviewers prefer a middle checkpoint to the final one. The optimizer may be finding response patterns the learned proxy overvalues. That is a reason to inspect independent outcomes and distribution shift, not to declare that reward optimization always fails. A diagnostic protocol should freeze which model is optimized, identify which evidence remains independent, and compare behavior as optimization pressure changes under a controlled evaluation design.
Separate the measured proxy from the evaluation target
A learned reward is fitted to a finite comparison process. Optimization deliberately searches for outputs with high scores, which can concentrate errors that were rare in an ordinary held-out sample. More best-of-N candidates, more policy updates, or weaker regularization can increase that selection pressure in different ways. Report those axes and the current response distribution rather than compare reward means across incompatible checkpoints or reward versions. An unchanged frozen reward model provides a consistent proxy scale for the diagnostic, while raw scores from separately normalized models may not be directly comparable.
Independent evaluation can include held-out human comparisons, task verification, rubric-specific checks, and another model whose failure modes are examined. Gao and colleagues study overoptimization in a synthetic setup where a larger fixed reward model supplies a gold-standard proxy for humans. Their gold score is a defined experimental target, not literal human utility or a guarantee about every deployment. Preserve that distinction when using the paper's results. A second judge sharing training data or style biases with the optimized model may provide less independence than its separate name suggests.
Compare trajectories against genuinely separate evidence
Evaluate a predefined set of optimization checkpoints on the same controlled prompt distribution, with blinded candidate identity and balanced presentation. Track proxy reward, independent win or task scores, measured divergence, response length, refusals, and other relevant slices. A reward rise accompanied by a decline in held-out evidence is a diagnostic pattern; identify concrete response changes before attributing the cause. The pattern can also reflect evaluation noise, rubric changes, or population drift, so uncertainty and protocol identity matter. Avoid using the same repeatedly tuned development score as untouched confirmation evidence.
A simple scalar counterexample makes the mechanism explicit. Suppose the independent quality diagnostic peaks at z=1 while the proxy peaks at z=0. Moving from z=2 to 1 improves both, but moving farther toward zero keeps improving the proxy while worsening the diagnostic. This proves a possibility under the specified functions, not inevitability for every learned reward or optimization algorithm. Real systems need examples and held-out measurements to determine whether a comparable mismatch exists, which behaviors drive it, and whether additional data or a changed objective addresses that mismatch.
Respond to evidence rather than selecting the largest reward
Possible responses include selecting an earlier evaluated checkpoint, limiting search or updates, revisiting comparison coverage, and collecting independently checked examples from the newly exposed response region. A KL penalty constrains a distributional tradeoff but does not make a misspecified reward true. Reassess the evaluation protocol after changing it, keeping fresh confirmation evidence where repeated selection has occurred. Preserve reproducible artifacts and a known approved rollback target so a release decision does not depend on reconstructing an old checkpoint from a mutable name.
The optimization lab implements gradient descent on z²/2. Reset, set both step size η=0.5 and initial z₀=2, predict the first two updates, then Step twice. The model uses z_k=z₀(1−η)^k, giving 1 and 0.5. Proxy rewards are therefore−0.5 and−0.125, while the separately calculated q values are 0 and−0.25. The instrument plots its quadratic loss, not q, annotations, language behavior, or a reward-learning process. Calculate q explicitly to see how one optimized quantity can improve while another stated diagnostic deteriorates.
Work it through
An improving proxy can pass a diagnostic optimum
Use the fictional proxy r_hat(z)=−z²/2 and separate diagnostic q(z)=−(z−1)². Start at z=2 and apply gradient descent on z²/2 with η=0.5 for two updates. Higher values of both reported functions are considered better within this toy example.
Initially z=2 gives proxy−2 and diagnostic−1. The first update multiplies z by 0.5, reaching 1.
At z=1, the proxy is−0.5 and diagnostic 0, so both improved. The second update reaches z=0.5.
At z=0.5, proxy is−0.125, a further improvement, but diagnostic is−0.25, worse than at the first update. An independent diagnostic would favor the middle point over the final point in this example.
The proxy improves monotonically over the two updates while the stated diagnostic peaks at the first. The mismatch is explicit and does not establish a universal law about real preference training.
The living notebook
Explore the model
Interactive lab · optimization
Compute a second diagnostic along a proxy-improving trajectory
Reset, set both η=0.5 and initial z₀=2, predict, then Step twice. The actual quadratic-loss model gives z=1 and 0.5. Compute q(z)=−(z−1)² separately:0 then−0.25. The instrument displays z²/2, not a learned reward, human labels, or the separate q curve.
- Position x0
- 2
- Objective x²/2
- 2
- Iteration behavior
- Stable step
Gradient descent on f(x) = x²/2: xₙ = (1 − η)ⁿx₀. Playback advances two discrete iterations per second. Values outside |x| ≤ 4 are explicitly reported. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forIndependent evidence can disagree with the quantity being optimized. Diagnose that relationship empirically rather than choosing the largest training reward automatically.
Pause & reason
Check your understanding
Your turn
Try it yourself
For the same fictional functions, compare z=1 and z=0.25. Compute proxy and diagnostic values, then state which quantity prefers each point.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Evaluate both functions separately and remember that higher is better here.
Compare with the solution
At z=1 the proxy is−0.5 and q=0. At z=0.25 the proxy is−0.03125 and q=−0.5625. The proxy prefers 0.25 while the separate diagnostic prefers 1. This stipulated disagreement illustrates a possible optimization mismatch, not measured language-model behavior.
Keep the idea
Take it with you
- A learned reward is an optimization proxy under a limited observation process.
- Increase optimization pressure while tracking independent, versioned held-out evidence.
- Use concrete diagnostic behavior to select or revise a release rather than maximizing one score blindly.
Read further
Original sources and deeper explanations to follow at your own pace.
- Gao et al.: Scaling Laws for Reward Model Overoptimization
- Ouyang et al.: Training Language Models to Follow Instructions with Human Feedback
- Christiano et al.: Deep Reinforcement Learning from Human Preferences
- Malik et al.: RewardBench 2, Advancing Reward Model Evaluation
- Rafailov et al.: Direct Preference Optimization, v 3
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.