Training language models to follow instructions with human feedback
arXiv:2203.02155 · PDF · 68 pp. · its place among the papers
One paper, several tellings. The big picture states the paper’s own thesis and contributions in its own terms; Inside the paper follows the paper’s own arc; Across the corpus traces how it connects to the other papers; The concepts lists everything the paper uses, in reading order. Pick a tab, then use the +/− toggles to open it level by level, or set a granularity to read the whole thing at that zoom.
By 2022 the largest language models could do remarkable things, yet still fabricated facts, produced toxic text, and ignored what users asked. InstructGPT locates the fault not in insufficient scale but in the training objective itself: predicting the next token of internet text is not the same task as following a person's instructions.
The argument runs from that diagnosis through a three-step remedy to a pointed headline: human evaluators prefer a 1.3-billion-parameter model trained this way over the 175-billion-parameter original. The closing chapters weigh what the paper itself weighs — the measured costs of the method, the failures that remain, and whose preferences the new objective actually encodes.
Read at
InstructGPT's argument: the objective was wrong, and feedback beats scale (5 chapters)
The paper's thesis has two halves. Diagnostic: large language models misbehave because their objective — next-token prediction — is misaligned with what users want, so scale alone cannot fix them. Constructive: fine-tuning on human feedback realigns the objective, and does so with striking economy — a 1.3B model trained this way is preferred by people to the 175B GPT-3. The evidence is win rates on real user prompts, truthfulness and toxicity benchmarks, and generalization to labelers who contributed no training data; the accounting includes an alignment tax, residual failures, and an unusually explicit answer to the question of who defined the target.
Chapter 1The diagnosis: the objective is wrong (3 concepts)
The paper argues that GPT-3's misbehavior is not a symptom of insufficient scale but of a misaligned objective: predicting the next token of internet text rewards continuing text, not doing what the user intended. 'Aligned' is given an operational definition borrowed from Askell et al. — helpful, honest, harmless — and following instructions is treated as a training objective in its own right, something to be optimized directly rather than coaxed out with clever prompts.
The misaligned objective concept (1 connection)
Next-token prediction on internet text is the paper's named culprit: a pretraining objective different from — and misaligned with — helpfully and safely following instructions.
connections
- Language modeling (next-token prediction) objective — is argued to be misaligned with → Instruction following (as a fine-tuning objective)
The objective it should have concept (4 connections)
Carrying out natural-language instructions across an open-ended range of tasks, trained and measured directly on what real users asked for.
connections
- FLAN (instruction-tuned baseline) — sets the comparison floor for → Instruction following (as a fine-tuning objective)
- GPT-3 (prompted) baseline — shows the limits of prompting alone for → Instruction following (as a fine-tuning objective)
- Language modeling (next-token prediction) objective — is argued to be misaligned with → Instruction following (as a fine-tuning objective)
- Quantitative vs. Qualitative Evaluation Methodology — prefigures → Instruction following (as a fine-tuning objective) hindsight
What 'aligned' means here concept (2 connections)
Helpful, honest, harmless — adopted from prior work and made empirical, with honesty deliberately operationalized as measurable truthfulness.
connections
- Evil (persona trait) — inverts the baseline encoded by → Helpful, honest, harmless (HHH) alignment framework hindsight
- Helpful, honest, harmless (HHH) alignment framework — is operationalized as → HHH Evaluation Set (binary comparisons)
Chapter 2The remedy: three steps of human feedback (4 concepts)
The construction is a pipeline: demonstrate, compare, optimize. Labelers write demonstrations of good behavior and a pretrained model is fine-tuned on them; labelers then rank model outputs and a reward model learns to predict their preferences; finally the policy is optimized against that reward model. The consequential choice is the training distribution — prompts submitted by real API users rather than a fixed compilation of NLP tasks — which is what lets the paper claim alignment to user intent rather than to a benchmark.
The inherited technique concept (6 connections)
RLHF — a learned model of human preferences used as the reward for RL — applied here to the open-ended distribution of things people actually ask a language model to do.
connections
- Asynchronous Reward-Learning Architecture — gives concrete shape to → Reinforcement learning from human feedback (RLHF)
- Base vs. RLHF-chat model representation comparison — measures the effect of → Reinforcement learning from human feedback (RLHF) hindsight
- Contrastive Activation Addition (CAA) — operates on top of → Reinforcement learning from human feedback (RLHF) hindsight
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Reinforcement learning from human feedback (RLHF) — swaps the labeler in → RL from AI Feedback (RLAIF)
- Sycophancy — misgeneralizes the training objective of → Reinforcement learning from human feedback (RLHF) hindsight
Step one: demonstrations concept (3 connections)
A GPT-3 model fine-tuned on labeler-written demonstrations — both a baseline in its own right and the initialization everything else builds on.
connections
- Supervised fine-tuned (SFT) model — anchors as both init and reference for → PPO fine-tuning stage (RLHF policy optimization)
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
- SFT dataset — duplication underlies early overfitting of → Supervised fine-tuned (SFT) model
Step two: comparisons concept (11 connections)
A model trained on labeler rankings to predict which output a human would prefer — the cheap, dense stand-in for human judgment that step three optimizes.
connections
- Adaptive L2 Regularization for the Reward Predictor — bounds the generalization gap of → Reward model (RM)
- Asynchronous Reward-Learning Architecture — trades its concurrency for a fixed dataset in → Reward model (RM) hindsight
- Bradley-Terry Model — supplies the loss for → Reward model (RM)
- Reward model (RM) — is overbuilt in anticipation of → Novel Behavior Training
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Recurrent Reward Model (Proposed Extension) — would generalize the fixed window of → Reward model (RM)
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Reward model pairwise comparison loss — under determines the scale of → Reward model (RM)
- Reward Prediction Normalization — fixes the underdetermined scale of → Reward model (RM)
- Scalable oversight — is retroactively operationalized by → Reward model (RM) hindsight
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
Step three: optimization concept (3 connections)
PPO fine-tunes the policy to maximize the reward model's score, with a per-token KL penalty holding it near the supervised model.
connections
- Non-Stationary Reward Function Challenge — resurfaces under iteration in → PPO fine-tuning stage (RLHF policy optimization) hindsight
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Supervised fine-tuned (SFT) model — anchors as both init and reference for → PPO fine-tuning stage (RLHF policy optimization)
Chapter 3The evidence: preferred, more truthful, and not just by its own judges (4 concepts)
Nearly every headline claim is denominated in win rate — how often labelers prefer one model's output over a fixed baseline on matched prompts — and the headline itself is the 1.3B-beats-175B comparison: alignment fine-tuning buys more human preference than a hundredfold increase in parameters. Around that sit the checks: held-out labelers who contributed no training data agree, truthfulness improves on TruthfulQA, toxicity drops on RealToxicityPrompts, and comparisons against FLAN, T0, and prompted GPT-3 argue that real user instructions are a different — and harder — target than NLP task compilations.
The currency of the claims concept (4 connections)
The primary human-evaluation metric: the fraction of matched-prompt contests a model wins against the 175B SFT baseline in labelers' judgment.
connections
- Elo Score (helpfulness/harmlessness) — generalizes → Win rate (preference against baseline) hindsight
- F1 score (span-overlap QA metric) — diverges under rlhf from → Win rate (preference against baseline)
- Inter-labeler agreement rate — caps the resolution of → Win rate (preference against baseline)
- Likert overall-quality rating — corroborates → Win rate (preference against baseline)
Judges who didn't train it concept (1 connection)
Labelers who contributed no training data prefer InstructGPT at similar rates — the paper's answer to the worry that the model merely learned forty people's tastes.
connections
- Labeler screening and selection process — creates the question answered by → Held-out labeler generalization test
Truthfulness, benchmarked concept (1 connection)
On a benchmark built from questions people commonly get wrong, the fine-tuned models improve on GPT-3 — honesty made into a number.
connections
- Sycophancy — is tested via → TruthfulQA hindsight
The rival recipe, outperformed concept (2 connections)
GPT-3 fine-tuned on the FLAN task compilation loses to InstructGPT on API prompts — evidence that instruction following, as users mean it, is not what NLP task suites teach.
connections
- FLAN (instruction-tuned baseline) — sets the comparison floor for → Instruction following (as a fine-tuning objective)
- T0 (instruction-tuned baseline) — is scaled to match → FLAN (instruction-tuned baseline)
Chapter 4The price, paid and named (5 concepts)
The paper coins a name for its method's cost — the alignment tax, measurable regressions on public NLP benchmarks — and argues that keeping it low is itself a safety concern, since a technique that makes models worse will not be adopted. The mitigation, mixing pretraining gradients into the RL updates, pays most of the tax down. What it cannot pay down are the qualitative residues, from hallucination — halved but present — to failures the paper traces to its own training choices and to over-optimizing the reward model.
The alignment tax concept (3 connections)
Alignment fine-tuning degrades some public-benchmark performance as a side effect — named, measured, and treated as a bill that must be kept small.
connections
- MMLU (Massive Multitask Language Understanding) — reruns the question behind → Alignment tax hindsight
- Preventative steering — answers → Alignment tax hindsight
- Reward model over-optimization — demands a different mitigation than → Alignment tax
Paying it down concept (2 connections)
Mixing language-modeling gradients on the pretraining distribution into PPO updates recovers most of the regressions — the paper's default model is this variant.
connections
- PPO-ptx (pretraining gradient mixing) — outperforms tightening of → Per-token KL penalty from the SFT model
- PPO-ptx (pretraining gradient mixing) — diverges only off distribution from → PPO (without pretraining mix)
Hallucination, halved concept (4 connections)
Closed-domain fabrication drops from 41% of outputs to 21% — an improvement the paper declines to call a solution.
connections
- Custom hallucination contrastive dataset — partitions into subtypes of → Hallucination (closed-domain fabrication)
- Hallucination (closed-domain fabrication) — sits in tension with → Excessive hedging on simple questions
- Hallucination (closed-domain fabrication) — is validated out of distribution on → HaluEval
- Trait-eliciting finetuning datasets (Evil, Sycophancy, Hallucination) — unintentionally amplifies → Hallucination (closed-domain fabrication)
Over-learned caution concept (5 connections)
Long, noncommittal answers to questions with a clear answer — plausibly the model learning the labeling instructions' reward for epistemic humility too well.
connections
- Excessive hedging on simple questions — is the harmlessness axis mirror of → Evasiveness hindsight
- Excessive hedging on simple questions — shares a fix but not a cause with → Failure to detect false-premise instructions
- Goodhart's law — operates at the subfeature level in → Excessive hedging on simple questions hindsight
- Hallucination (closed-domain fabrication) — sits in tension with → Excessive hedging on simple questions
- Reward model over-optimization — surfaces as → Excessive hedging on simple questions
Swallowed premises concept (1 connection)
Told to do something that assumes a falsehood, the model plays along rather than pushing back.
connections
- Excessive hedging on simple questions — shares a fix but not a cause with → Failure to detect false-premise instructions
Chapter 5Aligned to whom (3 concepts)
The paper's closing honesty is about the target itself. What the models are aligned to is not 'human values' but a documented process: the judgments of roughly forty screened contractors, applied to prompts from API users, under instructions the researchers wrote. The paper presents this specificity as both the method's strength — the target is auditable — and its open problem, since different labelers, users, and instructions would define a different alignment.
Forty screened judges concept (3 connections)
A four-criterion screening process selected the contractors whose preferences became the training signal — the alignment target has names and a hiring filter.
connections
- Contractor Preference-Labeling Protocol — becomes a screened operation in → Labeler screening and selection process hindsight
- Labeler screening and selection process — creates the question answered by → Held-out labeler generalization test
- Inter-labeler agreement rate — was both filter and audit for → Labeler screening and selection process
Whose questions count concept (2 connections)
The training prompts come from early API users — so the distribution of tasks the model is aligned on is also a specific population's.
connections
- API prompt distribution — supplies label free scale to → PPO dataset
- SFT dataset — bootstrapped the existence of → API prompt distribution
How much judges agree concept (3 connections)
Labelers agree with each other roughly three times in four — measured, reported, and a quiet ceiling on how sharp any preference-based claim can be.
connections
- Constant Rater-Error Noise Model — assumes a constant later measured by → Inter-labeler agreement rate hindsight
- Inter-labeler agreement rate — was both filter and audit for → Labeler screening and selection process
- Inter-labeler agreement rate — caps the resolution of → Win rate (preference against baseline)
InstructGPT is the paper where reinforcement learning from human feedback stopped being a research demo and became a recipe. OpenAI took GPT-3, a model trained only to predict the next token of internet text, and taught it to follow instructions in three steps: human demonstrations, human comparisons between model outputs, and reinforcement learning against a model of those comparisons.
This story follows the paper's own arc: the argument that the pretraining objective was the wrong target, the forty contractors and three datasets that supplied the human signal, the three-stage pipeline itself, and finally the verdict — including the costs and failure modes the paper is unusually candid about.
Read at
Inside InstructGPT: demonstrate, compare, optimize (5 chapters)
A 1.3B model fine-tuned on human feedback produces outputs people prefer to those of a 175B model without it; the paper's whole argument is the three-step procedure that makes this possible, and its honesty lies in pricing what the procedure costs.
Chapter 1The wrong objective (3 sections)
The paper opens with a diagnosis rather than a system: making language models bigger does not make them better at doing what users want, because the language-modeling objective — predict the next token of internet text — is simply a different target from following a user's instruction helpfully and safely (instructgpt, §"1 Introduction", p. 2). Before that new target can be trained toward, it has to be defined. The paper borrows the helpful-honest-harmless framework as its working definition of alignment, and defines instruction following against its nearest rivals: FLAN and T0, which fine-tune on fixed compilations of reformatted NLP tasks, and the prompted baseline, which tries to coax the behavior out of an unmodified GPT-3 with a few-shot prefix. Everything the rest of the paper builds is in service of this reframing.
Instruction following as the objective concept (4 connections)
The paper's chosen target: carrying out natural-language instructions across an open-ended range of tasks, trained and measured on real user prompts rather than a fixed task compilation — which is exactly what separates it from FLAN and T0 (instructgpt, §"1 Introduction", p. 1).
connections
- FLAN (instruction-tuned baseline) — sets the comparison floor for → Instruction following (as a fine-tuning objective)
- GPT-3 (prompted) baseline — shows the limits of prompting alone for → Instruction following (as a fine-tuning objective)
- Language modeling (next-token prediction) objective — is argued to be misaligned with → Instruction following (as a fine-tuning objective)
- Quantitative vs. Qualitative Evaluation Methodology — prefigures → Instruction following (as a fine-tuning objective) hindsight
Helpful, honest, harmless concept (2 connections)
Adapted from Askell et al., this supplies the paper's definition of aligned. Honesty is deliberately operationalized as measurable truthfulness, since a model's actual internal beliefs cannot be inspected (instructgpt, §"1 Introduction", p. 2).
connections
- Evil (persona trait) — inverts the baseline encoded by → Helpful, honest, harmless (HHH) alignment framework hindsight
- Helpful, honest, harmless (HHH) alignment framework — is operationalized as → HHH Evaluation Set (binary comparisons)
The full argument for the new objective theme (5 concepts)
The claim that instruction following is a different training objective, not one more task — argued by comparison against the baselines that come closest to it.
Language modeling (next-token prediction) objective (1 connection)
- Language modeling (next-token prediction) objective — is argued to be misaligned with → Instruction following (as a fine-tuning objective)
InstructGPT opens by arguing that the standard pretraining objective, predicting the next token on internet text, is misaligned with what users actually want, and that scaling up this objective does not close the gap, since "making language models bigger does not inherently make them" better at following intent.
Instruction following (as a fine-tuning objective) (4 connections)
- FLAN (instruction-tuned baseline) — sets the comparison floor for → Instruction following (as a fine-tuning objective)
- GPT-3 (prompted) baseline — shows the limits of prompting alone for → Instruction following (as a fine-tuning objective)
- Language modeling (next-token prediction) objective — is argued to be misaligned with → Instruction following (as a fine-tuning objective)
- Quantitative vs. Qualitative Evaluation Methodology — prefigures → Instruction following (as a fine-tuning objective) hindsight
Instruction following is the alternative objective InstructGPT proposes in its place: the capability to carry out natural-language task instructions across an open-ended range of tasks, trained and measured here directly via RLHF on real user-submitted prompts rather than through a fixed compilation of reformatted NLP tasks. The rest of this walk measures that objective against its nearest methodological rivals.
GPT-3 (prompted) baseline (2 connections)
- Few-shot prompting — shares its mechanism with → GPT-3 (prompted) baseline hindsight
- GPT-3 (prompted) baseline — shows the limits of prompting alone for → Instruction following (as a fine-tuning objective)
The GPT-3 prompted baseline is the first rival: an unmodified model coaxed toward instruction-following behavior purely with a hand-crafted few-shot prefix, no weight updates at all. It shows the limits of prompting alone for instruction following, establishing a floor that any trained approach must clear.
T0 (instruction-tuned baseline) (1 connection)
- T0 (instruction-tuned baseline) — is scaled to match → FLAN (instruction-tuned baseline)
T0 represents a heavier, trained rival instead: a compilation of NLP tasks reformatted with natural-language instructions, fine-tuned here as the T0++ variant into a 175B-parameter baseline containing roughly 96 million datapoints.
FLAN (instruction-tuned baseline) (2 connections)
- FLAN (instruction-tuned baseline) — sets the comparison floor for → Instruction following (as a fine-tuning objective)
- T0 (instruction-tuned baseline) — is scaled to match → FLAN (instruction-tuned baseline)
FLAN is T0's smaller instruction-tuning counterpart, built on the same cross-task-compilation idea but with only about 1.2 million datapoints; T0 is deliberately scaled to match FLAN so neither baseline simply wins on data volume. Both public-NLP-compilation baselines set the comparison floor for instruction following: InstructGPT outputs are preferred over FLAN's 78% of the time head-to-head, a gap the paper attributes to compilations like FLAN favoring tasks that are easy to formalize rather than the genuinely open-ended intent instruction following was built to capture.
Chapter 2Forty people and three datasets (4 sections)
Before any training step runs, the paper builds the human machinery everything else consumes. Roughly forty contractors, chosen by a four-criterion screening process, write demonstrations and rank model outputs through a purpose-built web interface, recording failures against a fixed metadata taxonomy (instructgpt, §"B.1 Labeler selection", p. 36). The prompts they work on come mostly from real users of an earlier InstructGPT model, deduplicated and filtered, and they feed three datasets, one per pipeline stage: about 13k prompts with demonstrations in the SFT dataset, 33k with ranked outputs for the reward model, and 31k unlabeled prompts in the PPO dataset for RL rollouts (instructgpt, §"3.2 Dataset", p. 7). The paper treats this infrastructure as part of the method rather than logistics: it measures whether labelers agree with each other — 72.6% of the time — and whether their preferences generalize beyond the group that produced them (instructgpt, §"3.4 Human data collection", p. 8).
Real prompts from real users concept (2 connections)
The paper's defining data choice: prompts submitted by actual API users, not tasks invented by researchers. This is what lets it claim to train on what people genuinely ask for (instructgpt, §"3.2 Dataset", p. 6).
connections
- API prompt distribution — supplies label free scale to → PPO dataset
- SFT dataset — bootstrapped the existence of → API prompt distribution
Choosing whose preferences count concept (3 connections)
The roughly forty contractors were selected on four criteria weighted toward sensitivity to harmful content — the paper's answer to the question of whose preferences the model learns begins here (instructgpt, §"B.1 Labeler selection", p. 36).
connections
- Contractor Preference-Labeling Protocol — becomes a screened operation in → Labeler screening and selection process hindsight
- Labeler screening and selection process — creates the question answered by → Held-out labeler generalization test
- Inter-labeler agreement rate — was both filter and audit for → Labeler screening and selection process
Rankings, not ratings concept (3 connections)
Each of the 33k comparison prompts carries K=4 to 9 ranked outputs, so one sitting of labeler work yields C(K,2) pairwise comparisons — an order of magnitude more comparisons than prompts (instructgpt, §"3.2 Dataset", p. 7).
connections
- SFT dataset — trains the policies sampled for → RM (comparison) dataset
- Trajectory Segment — generalizes into → RM (comparison) dataset hindsight
- Web labeling interface — filters uncertain comparisons out of → RM (comparison) dataset
The whole human-data apparatus theme (11 concepts)
Screening, interfaces, taxonomies, agreement rates: the infrastructure RLHF actually runs on, traced back to its primitive 2017 ancestor.
Preference Elicitation Protocol (4 connections)
- Cooperative Inverse Reinforcement Learning (CIRL) — is narrowed to a preferences only channel in → Preference Elicitation Protocol
- Preference Elicitation Protocol — avoids the overfitting problem solved by → K-choose-2 single-batch comparison training hindsight
- Trajectory Segment — supplies the comparison unit for → Preference Elicitation Protocol
- Use demonstrations (safe exploration) — is explicitly passed over in favor of → Preference Elicitation Protocol
The preference elicitation protocol is the primitive ancestor of this whole human-data infrastructure: in 2017, a human overseer watches two rendered video clips of an agent's behavior and records a preference, a tie, or an incomparable judgment into a growing preference database. That same three-way response structure, prefer one side, call it a tie, or admit it can't be judged, still shapes how InstructGPT's labeling apparatus works five years later.
Contractor Preference-Labeling Protocol (7 connections)
- Ant (MuJoCo task) — hard codes an upright priority into → Contractor Preference-Labeling Protocol
- Half-Cheetah (MuJoCo task) — was exempted from → Contractor Preference-Labeling Protocol
- Hopper (MuJoCo task) — exposes the scheduling fragility of → Contractor Preference-Labeling Protocol
- Contractor Preference-Labeling Protocol — grounds the headline efficiency claim of → Human-Feedback Sample Efficiency
- Label Annealing — is only approximated under → Contractor Preference-Labeling Protocol
- Contractor Preference-Labeling Protocol — becomes a screened operation in → Labeler screening and selection process hindsight
- Contractor Preference-Labeling Protocol — is formalized as → Web labeling interface hindsight
The contractor preference-labeling protocol is how that primitive was actually staffed in 2017: paid contractors sign up for time slots, receive a one-to-two sentence description of the task, and repeatedly compare pairs of video clips through a keyboard-driven interface offering prefer-left, prefer-right, tie, and can't-tell responses. It is the first working answer to a question every later stage of this walk answers again at greater scale: who does the labeling, and how are they organized to do it consistently.
API prompt distribution (2 connections)
- API prompt distribution — supplies label free scale to → PPO dataset
- SFT dataset — bootstrapped the existence of → API prompt distribution
InstructGPT (2022) scales the 2017 primitive into a purpose-built pipeline, and the API prompt distribution is where that pipeline's data starts: text submitted by external users to an earlier, demonstration-only InstructGPT model on the OpenAI Playground, deduplicated, capped per user, and filtered for personally identifiable information. Every dataset in the rest of this walk draws its raw prompts from here.
SFT dataset (3 connections)
- SFT dataset — bootstrapped the existence of → API prompt distribution
- SFT dataset — trains the policies sampled for → RM (comparison) dataset
- SFT dataset — duplication underlies early overfitting of → Supervised fine-tuned (SFT) model
The SFT dataset pairs roughly 13,000 of those prompts with human demonstrations, but the relationship with its source is circular: the Playground traffic behind the API prompt distribution was itself submitted to an earlier model trained on a subset of this same demonstration data, so each partly bootstrapped the other's existence.
RM (comparison) dataset (3 connections)
- SFT dataset — trains the policies sampled for → RM (comparison) dataset
- Trajectory Segment — generalizes into → RM (comparison) dataset hindsight
- Web labeling interface — filters uncertain comparisons out of → RM (comparison) dataset
The RM dataset trains the reward model on roughly 33,000 prompts, each with several outputs ranked by labelers, and those completions come overwhelmingly from policies trained on the SFT dataset just introduced. It marks a step up in labeling effort, from writing one demonstration per prompt to ranking several model outputs against each other.
PPO dataset (1 connection)
- API prompt distribution — supplies label free scale to → PPO dataset
The PPO dataset completes the trio at the opposite extreme of labeling effort: roughly 31,000 prompts drawn purely from the API prompt distribution, with no human labels at all, closing a declining gradient of human effort per prompt that runs from full demonstrations, to rankings, to nothing.
Labeler screening and selection process (3 connections)
- Contractor Preference-Labeling Protocol — becomes a screened operation in → Labeler screening and selection process hindsight
- Labeler screening and selection process — creates the question answered by → Held-out labeler generalization test
- Inter-labeler agreement rate — was both filter and audit for → Labeler screening and selection process
None of these three datasets exists without the roughly 40 contractors selected through this four-criterion screening process, covering agreement on sensitive-speech flagging, agreement on rankings, sensitive demonstration writing quality, and self-assessed ability to identify sensitive content across groups. The walk now turns from the data itself to the human infrastructure that produced it.
Inter-labeler agreement rate (3 connections)
- Constant Rater-Error Noise Model — assumes a constant later measured by → Inter-labeler agreement rate hindsight
- Inter-labeler agreement rate — was both filter and audit for → Labeler screening and selection process
- Inter-labeler agreement rate — caps the resolution of → Win rate (preference against baseline)
Inter-labeler agreement enters this pipeline on both sides of the screening process just described: two of its four criteria are agreement measures used to filter candidates in, and the same statistic is later recomputed as an audit of the labelers who made it through.
Web labeling interface (2 connections)
- Contractor Preference-Labeling Protocol — is formalized as → Web labeling interface hindsight
- Web labeling interface — filters uncertain comparisons out of → RM (comparison) dataset
The web labeling interface is where screened labelers actually record their judgments, assigning Likert scores, metadata labels, and full rankings; because it collects rankings of four to nine completions per prompt rather than isolated pairs, it is what filters uncertain comparisons out of the RM dataset introduced earlier.
- Labeler metadata annotation taxonomy
The labeler metadata annotation taxonomy is the fixed set of fields that interface asks labelers to fill in for every rated output, binary and Likert-scale flags for failures like hallucination or denigration of a protected class, turning each labeling session into structured data rather than just a ranking.
Held-out labeler generalization test (1 connection)
- Labeler screening and selection process — creates the question answered by → Held-out labeler generalization test
The held-out labeler generalization test is the question the screening process creates the need to answer: because every training label came from the same roughly 40 screened contractors, this test checks whether models trained on their preferences hold up for a separate group of labelers who contributed no training data at all. It closes the walk by auditing the trustworthiness of everything built on top of this human infrastructure, all the way back to the simple three-way judgment the 2017 protocol first asked a person to make.
Chapter 3The three steps (4 sections)
The pipeline takes three steps, each consuming the previous one's output. Supervised fine-tuning trains GPT-3 directly on the demonstrations to produce the SFT model, the initialization for everything downstream. The reward model is that SFT model with its final unembedding layer swapped for a scalar head, trained with a pairwise comparison loss so that the reward gap between two completions represents the log odds a human would prefer one (instructgpt, §"3.5 Models", p. 8). PPO then optimizes the SFT model against the reward model's score, treating each prompt-response exchange as a single-step bandit episode, with a per-token KL penalty holding the policy near its starting distribution. The load-bearing details are small and specific: batching all comparisons from one ranking into a single element so the reward model does not overfit, and mixing pretraining gradients back into the RL updates. What the paper calls InstructGPT is, by default, that last variant — PPO-ptx.
The pipeline end to end theme (8 concepts)
The full procedure, from GPT-3 through SFT and reward modeling to PPO — the walk through what RLHF denotes in this paper.
InstructGPT (1 connection)
- InstructGPT — outperforms at 100x smaller scale → GPT-3 (pretrained language model)
InstructGPT names the family of GPT-3 models produced by a specific three-step training procedure, and this walk follows that procedure end to end, from the base model it starts with through to the reinforcement-learning stage that finishes it.
GPT-3 (pretrained language model) (1 connection)
- InstructGPT — outperforms at 100x smaller scale → GPT-3 (pretrained language model)
GPT-3 is the pretrained autoregressive language model that supplies both the architecture and the initialization for every model in the pipeline. Despite sharing GPT-3's weights as a starting point, InstructGPT models outperform it at 100 times smaller scale, a controlled result since fine-tuning on the human data pipeline is the only thing that differs.
Supervised fine-tuning (SFT) (4 connections)
- CAA combined with supervised finetuning comparison — runs head to head against → Supervised fine-tuning (SFT)
- CAA vs. finetuning computational cost comparison — avoids the memory cost of → Supervised fine-tuning (SFT)
- Supervised fine-tuning (SFT) — is the mechanism that produces → Finetuning shift (activation-shift metric)
- Use demonstrations (safe exploration) — operationalized as → Supervised fine-tuning (SFT) hindsight
Supervised fine-tuning is the first of the three steps: the pretrained GPT-3 model is fine-tuned directly on human-written demonstrations of desired behavior using standard supervised learning, no reward model or reinforcement learning involved yet.
Supervised fine-tuned (SFT) model (3 connections)
- Supervised fine-tuned (SFT) model — anchors as both init and reference for → PPO fine-tuning stage (RLHF policy optimization)
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
- SFT dataset — duplication underlies early overfitting of → Supervised fine-tuned (SFT) model
The SFT model is what that first step produces, and it does double duty from here on: it serves as a standalone baseline for comparison, and, as the next two steps show, as the very foundation the reward model and PPO training are both built on.
Reward model (RM) (11 connections)
- Adaptive L2 Regularization for the Reward Predictor — bounds the generalization gap of → Reward model (RM)
- Asynchronous Reward-Learning Architecture — trades its concurrency for a fixed dataset in → Reward model (RM) hindsight
- Bradley-Terry Model — supplies the loss for → Reward model (RM)
- Reward model (RM) — is overbuilt in anticipation of → Novel Behavior Training
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Recurrent Reward Model (Proposed Extension) — would generalize the fixed window of → Reward model (RM)
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Reward model pairwise comparison loss — under determines the scale of → Reward model (RM)
- Reward Prediction Normalization — fixes the underdetermined scale of → Reward model (RM)
- Scalable oversight — is retroactively operationalized by → Reward model (RM) hindsight
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
The reward model is initialized from the SFT model itself, with its unembedding layer replaced by a scalar output head, and trained to predict which of two outputs human labelers would prefer. Selection pressure actually runs backward through the pipeline here: the SFT checkpoint used was chosen partly because later epochs kept improving the reward model's own downstream score.
Reward model pairwise comparison loss (3 connections)
- Bradley-Terry Model — is carried over unchanged into → Reward model pairwise comparison loss hindsight
- Reward model pairwise comparison loss — under determines the scale of → Reward model (RM)
- Reward Prediction Normalization — prefigures the scale fix in → Reward model pairwise comparison loss hindsight
The reward model is trained with a pairwise comparison loss where the reward gap between preferred and dispreferred completions represents the log odds a human would prefer the former. Because that loss only ever sees differences between rewards, it under-determines the model's absolute scale, producing a ranker whose raw output is meaningless on its own, a detail that matters once the ranker is reused as an RL reward.
PPO fine-tuning stage (RLHF policy optimization) (3 connections)
- Non-Stationary Reward Function Challenge — resurfaces under iteration in → PPO fine-tuning stage (RLHF policy optimization) hindsight
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Supervised fine-tuned (SFT) model — anchors as both init and reference for → PPO fine-tuning stage (RLHF policy optimization)
PPO fine-tuning is the third step, further tuning the SFT model with reinforcement learning to maximize the reward model's score; the SFT model anchors both where this optimization begins and, via a KL term, what it is pulled back toward. Every PPO policy here, even the largest, is supervised from below by a reward model roughly 30 times smaller than the policy it steers.
Reinforcement learning from human feedback (RLHF) (6 connections)
- Asynchronous Reward-Learning Architecture — gives concrete shape to → Reinforcement learning from human feedback (RLHF)
- Base vs. RLHF-chat model representation comparison — measures the effect of → Reinforcement learning from human feedback (RLHF) hindsight
- Contrastive Activation Addition (CAA) — operates on top of → Reinforcement learning from human feedback (RLHF) hindsight
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Reinforcement learning from human feedback (RLHF) — swaps the labeler in → RL from AI Feedback (RLAIF)
- Sycophancy — misgeneralizes the training objective of → Reinforcement learning from human feedback (RLHF) hindsight
Reinforcement learning from human feedback is the name for this whole three-step procedure taken together: a learned model of human preference used as a reward signal for reinforcement learning, applied to open-ended instruction following rather than a single fixed task. It is the umbrella this entire walk has been building toward, one term for GPT-3 plus demonstrations plus a reward model plus PPO.
Step one: the SFT model concept (3 connections)
Trained for 16 epochs even though validation loss says to stop after one, because human preference keeps improving — the final checkpoint is chosen by reward-model score, not validation loss (instructgpt, §"3.5 Models", p. 8).
connections
- Supervised fine-tuned (SFT) model — anchors as both init and reference for → PPO fine-tuning stage (RLHF policy optimization)
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
- SFT dataset — duplication underlies early overfitting of → Supervised fine-tuned (SFT) model
Step two: the reward model concept (11 connections)
Only ever trained at 6B scale, because 175B reward-model training proved unstable — so the judge is nearly thirty times smaller than the largest policy it steers (instructgpt, §"3.5 Models", p. 8).
The batching trick that stops overfitting concept (1 connection)
All C(K,2) comparisons from one ranking go into a single batch element; treating them as independent shuffled datapoints caused the reward model to overfit within one epoch (instructgpt, §"3.5 Models", p. 8).
connections
- Preference Elicitation Protocol — avoids the overfitting problem solved by → K-choose-2 single-batch comparison training hindsight
connections
- Adaptive L2 Regularization for the Reward Predictor — bounds the generalization gap of → Reward model (RM)
- Asynchronous Reward-Learning Architecture — trades its concurrency for a fixed dataset in → Reward model (RM) hindsight
- Bradley-Terry Model — supplies the loss for → Reward model (RM)
- Reward model (RM) — is overbuilt in anticipation of → Novel Behavior Training
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Recurrent Reward Model (Proposed Extension) — would generalize the fixed window of → Reward model (RM)
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Reward model pairwise comparison loss — under determines the scale of → Reward model (RM)
- Reward Prediction Normalization — fixes the underdetermined scale of → Reward model (RM)
- Scalable oversight — is retroactively operationalized by → Reward model (RM) hindsight
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
Step three: PPO against the reward model concept (3 connections)
The final stage tunes the SFT model with reinforcement learning to maximize the reward model's score — the point where the learned preference signal actually changes the policy (instructgpt, §"3.5 Models", p. 9).
The KL leash concept (4 connections)
Subtracted from the reward at every generated token to limit over-optimization of the learned reward; ablations put the useful coefficient near 0.01–0.02, with both zero and very large values hurting human ratings (instructgpt, §"3.5 Models", p. 9).
connections
- Per-token KL penalty from the SFT model — densifies the terminal reward of → Bandit environment formulation for RLHF
- Per-token KL penalty from the SFT model — was not the fix applied to → Evasiveness hindsight
- PPO-ptx (pretraining gradient mixing) — outperforms tightening of → Per-token KL penalty from the SFT model
- Reward model over-optimization — is preemptively countered by → Per-token KL penalty from the SFT model
PPO-ptx: mixing pretraining back in concept (2 connections)
Gradients from the pretraining language-modeling loss are mixed into the PPO updates to counteract benchmark regressions — and this variant is what the name InstructGPT refers to by default (instructgpt, §"3.5 Models", p. 9).
connections
- PPO-ptx (pretraining gradient mixing) — outperforms tightening of → Per-token KL penalty from the SFT model
- PPO-ptx (pretraining gradient mixing) — diverges only off distribution from → PPO (without pretraining mix)
The rest of the machinery theme (7 concepts)
The engineering choices underneath the RL stage — the bandit formulation, the value function initialized from the reward model, advantage estimation without discounting.
Bandit environment formulation for RLHF (2 connections)
- Bandit environment formulation for RLHF — renders discounting moot in → Generalized advantage estimation (GAE)
- Per-token KL penalty from the SFT model — densifies the terminal reward of → Bandit environment formulation for RLHF
The bandit environment formulation is the RL setup underlying all of PPO fine-tuning: a random customer prompt is presented, the policy produces one response, the reward model assigns a single reward, and the episode ends immediately. Every other mechanic in this walk is a consequence of this one structural choice.
- PPO value function
The PPO value function is the critic that estimates expected reward within this single-step environment, and it is initialized from the trained reward model's own weights rather than from scratch, inheriting whatever the reward model already knows about what a good response looks like.
Generalized advantage estimation (GAE) (1 connection)
- Bandit environment formulation for RLHF — renders discounting moot in → Generalized advantage estimation (GAE)
Generalized advantage estimation is the technique PPO uses to turn the value function's estimates into a training signal, but the bandit environment renders one of its two usual bias-variance knobs moot: with no future timesteps to discount, GAE is applied here with no discounting at all.
Per-token KL penalty from the SFT model (4 connections)
- Per-token KL penalty from the SFT model — densifies the terminal reward of → Bandit environment formulation for RLHF
- Per-token KL penalty from the SFT model — was not the fix applied to → Evasiveness hindsight
- PPO-ptx (pretraining gradient mixing) — outperforms tightening of → Per-token KL penalty from the SFT model
- Reward model over-optimization — is preemptively countered by → Per-token KL penalty from the SFT model
The per-token KL penalty is the one part of the objective that is not terminal: where the bandit environment delivers the reward model's score just once, at the end of the episode, the KL penalty is subtracted at every generated token, densifying an otherwise single-number reward and keeping the policy from drifting too far from the SFT model it started from.
PPO (without pretraining mix) (1 connection)
- PPO-ptx (pretraining gradient mixing) — diverges only off distribution from → PPO (without pretraining mix)
PPO without pretraining mix is the ablation variant that optimizes purely reward-model score plus this KL penalty, with the pretraining-gradient coefficient set to zero. It is the baseline against which the next variant is measured.
PPO-ptx (pretraining gradient mixing) (2 connections)
- PPO-ptx (pretraining gradient mixing) — outperforms tightening of → Per-token KL penalty from the SFT model
- PPO-ptx (pretraining gradient mixing) — diverges only off distribution from → PPO (without pretraining mix)
PPO-ptx adds gradients from the pretraining language-modeling loss into the same PPO updates, to counteract regressions on public NLP tasks, and it was tested directly against tightening the KL penalty instead, which sacrificed validation reward without fully fixing those regressions. On the paper's own headline preference metric, though, PPO-ptx diverges only off-distribution from plain PPO, the two are nearly the same model on the API distribution they were built for.
K-choose-2 single-batch comparison training (1 connection)
- Preference Elicitation Protocol — avoids the overfitting problem solved by → K-choose-2 single-batch comparison training hindsight
K-choose-2 batching closes this walk on the reward-model side of the same engineering effort: it places every pairwise comparison from one ranked set of K outputs into a single batch element, avoiding the overfitting that would result from treating those correlated comparisons as independent shuffled data. Alongside the bandit formulation, the value function, GAE, and the KL penalty, it is one more load-bearing detail behind making RLHF actually work in practice.
connections
- Non-Stationary Reward Function Challenge — resurfaces under iteration in → PPO fine-tuning stage (RLHF policy optimization) hindsight
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Supervised fine-tuned (SFT) model — anchors as both init and reference for → PPO fine-tuning stage (RLHF policy optimization)
Chapter 4The verdict (5 sections)
The headline result is stated in the abstract: outputs from the 1.3B InstructGPT are preferred to outputs from the 175B GPT-3, a model over a hundred times larger (instructgpt, §"Abstract", p. 1). At matched 175B scale the preference is 85% against plain GPT-3 and 71% against its few-shot prompted version (instructgpt, §"3.6 Evaluation", p. 10). The paper then checks the result from angles its own labelers cannot supply: held-out labelers who contributed no training data prefer InstructGPT at similar rates, gains appear on TruthfulQA and RealToxicityPrompts, and a battery of public NLP benchmarks stands guard for what the alignment costs. The gains are real but bounded — bias on Winogender and CrowS-Pairs, for instance, does not improve.
The model the paper is named for concept (1 connection)
The name covers a family of models, but the default referent is PPO-ptx, and the 1.3B-beats-175B comparison is the whole pipeline's proof of value: alignment fine-tuning buys more preference than a hundredfold increase in parameters (instructgpt, §"Abstract", p. 1).
connections
- InstructGPT — outperforms at 100x smaller scale → GPT-3 (pretrained language model)
Win rate, the paper's currency concept (4 connections)
How often labelers prefer a model's output over the 175B SFT baseline on matched prompts — nearly every headline claim in the paper is denominated in this metric (instructgpt, §"3.6 Evaluation", p. 10).
connections
- Elo Score (helpfulness/harmlessness) — generalizes → Win rate (preference against baseline) hindsight
- F1 score (span-overlap QA metric) — diverges under rlhf from → Win rate (preference against baseline)
- Inter-labeler agreement rate — caps the resolution of → Win rate (preference against baseline)
- Likert overall-quality rating — corroborates → Win rate (preference against baseline)
Do other people agree? concept (1 connection)
The paper's answer to the worry that the model merely learned its own forty labelers' tastes: held-out labelers who contributed no training data prefer InstructGPT at similar rates (instructgpt, §"3.4 Human data collection", p. 8).
connections
- Labeler screening and selection process — creates the question answered by → Held-out labeler generalization test
Instruments built for harms theme (7 concepts)
Truthfulness, toxicity, and bias each get a dedicated benchmark, because the capability suite would catch none of them.
TruthfulQA (1 connection)
- Sycophancy — is tested via → TruthfulQA hindsight
TruthfulQA opens this theme as a dedicated truthfulness probe: a set of short-answer questions designed so that mimicking common human falsehoods, rather than reasoning correctly, produces a wrong answer, catching a failure mode overlap-based capability metrics would never register.
RealToxicityPrompts (2 connections)
- Perspective API — supplies the ground truth for → RealToxicityPrompts
- RealToxicityPrompts — diverges under respectful prompting from → Winogender
RealToxicityPrompts shifts the theme from truthfulness to toxicity, supplying sentence-start prompts with varying toxicity to test whether a model continues text toxically, a harm that a fact-oriented benchmark like TruthfulQA was never designed to catch.
Perspective API (1 connection)
- Perspective API — supplies the ground truth for → RealToxicityPrompts
Perspective API supplies the ground truth for RealToxicityPrompts: since the benchmark ships only prompts, not judgments, every continuation's toxicity score comes from this third-party classifier, cross-checked against human toxicity ratings to confirm the automated score can be trusted.
Winogender (2 connections)
- Entropy-based bias metric — recasts the task of → Winogender
- RealToxicityPrompts — diverges under respectful prompting from → Winogender
Winogender pivots the theme again, from toxicity to social bias, while sharing an unusually direct link back: RealToxicityPrompts actually reuses Winogender's exact basic/respectful/biased prompting protocol, and the two evaluations diverge specifically under the 'respectful' variant.
Entropy-based bias metric (2 connections)
- Entropy-based bias metric — strips the direction from → CrowS-Pairs
- Entropy-based bias metric — recasts the task of → Winogender
The entropy-based bias metric recasts what Winogender measures: originally a coreference-accuracy diagnostic, it is rebuilt into binary multiple-choice items whose log-probabilities are converted into a Bernoulli distribution, so lower entropy signals a stronger, more biased preference.
CrowS-Pairs (1 connection)
- Entropy-based bias metric — strips the direction from → CrowS-Pairs
CrowS-Pairs receives the same treatment as Winogender: its native directional scoring, how often a model favors the stereotyping sentence of a pair, is stripped away and replaced by the same entropy-over-probabilities method, giving both bias benchmarks one shared instrument. Between them, TruthfulQA, RealToxicityPrompts, Winogender, and CrowS-Pairs make this theme's claim: truthfulness and bias needed dedicated instruments the general NLP benchmark suite could not have supplied.
HaluEval (1 connection)
- Hallucination (closed-domain fabrication) — is validated out of distribution on → HaluEval
HaluEval extends that instrument-building lineage to hallucination specifically, closing the theme with a 2023 hallucination-detection benchmark rather than a bias or toxicity one. The 2025 persona-vectors paper borrows the first 1,000 questions of its QA split as an external, out-of-distribution question set, confirming that hallucination trait expression scores measured on its own evaluation questions generalize to a standard, independently constructed benchmark rather than being an artifact of the paper's own question design.
The regression watch theme (9 concepts)
Eight public benchmarks the paper did not design, enlisted to detect whether alignment fine-tuning traded away general capability.
DROP (Discrete Reasoning Over the content of Paragraphs) (2 connections)
- HellaSwag — escapes the regression that persists in → DROP (Discrete Reasoning Over the content of Paragraphs)
- SQuAD v2 — forms the regression testbed with → DROP (Discrete Reasoning Over the content of Paragraphs)
DROP opens the language-understanding suite as a test of discrete reasoning over paragraphs, counting and sorting facts rather than simply retrieving them, and it is one of two benchmarks the paper elevates from passive evaluation into an active tuning target.
SQuAD v2 (1 connection)
- SQuAD v2 — forms the regression testbed with → DROP (Discrete Reasoning Over the content of Paragraphs)
SQuAD v2 forms the regression testbed together with DROP: both were pulled out of the eight benchmarks to actually judge the pretraining-coefficient and KL-coefficient sweeps during training, so these two shape RLHF's tradeoffs rather than merely observing them afterward.
HellaSwag (1 connection)
- HellaSwag — escapes the regression that persists in → DROP (Discrete Reasoning Over the content of Paragraphs)
HellaSwag, which asks a model to pick the most plausible continuation of a scenario, appeared alongside DROP on the paper's original list of RLHF regressions, but the two diverge under the fix: PPO-ptx recovers enough to surpass GPT-3 on HellaSwag while still lagging on DROP, showing the alignment tax is uneven.
- QuAC (Question Answering in Context)
QuAC extends the comprehension battery into dialogue, scoring conversational question answering rather than the single-turn extraction that DROP, SQuAD v2, and HellaSwag test, broadening what this suite of benchmarks counts as language understanding.
- SST (Stanford Sentiment Treebank)
SST narrows back down to the simplest probe in the suite, binary sentiment classification, rounding out the battery with a task that carries almost none of the multi-step reasoning DROP demands or the plausibility judgment HellaSwag requires.
SuperGLUE (2 connections)
- MMLU (Massive Multitask Language Understanding) — tests a different competence than → SuperGLUE hindsight
- WSC (Winograd Schema Challenge) — departs from the canonical format of → SuperGLUE
SuperGLUE is not itself one more task to score but the umbrella suite that supplies InstructGPT's final two benchmarks in this theme, RTE and WSC, both drawn in for general-purpose language understanding rather than any of InstructGPT's own instruction-following goals.
- RTE (Recognizing Textual Entailment)
RTE tests textual entailment, one of SuperGLUE's core tasks, and is the more conventional of the suite's final pair: a binary judgment scored in essentially the same form SuperGLUE originally specifies for it.
WSC (Winograd Schema Challenge) (1 connection)
- WSC (Winograd Schema Challenge) — departs from the canonical format of → SuperGLUE
WSC ends InstructGPT's own portion of the suite on a methodological wrinkle: though credited to SuperGLUE, the task InstructGPT actually runs departs from SuperGLUE's canonical binary-judgment format, asking the model to generate the pronoun's referent outright, a reminder that even off-the-shelf benchmarks get reshaped in practice.
MMLU (Massive Multitask Language Understanding) (4 connections)
- MMLU (Massive Multitask Language Understanding) — reruns the question behind → Alignment tax hindsight
- MMLU (Massive Multitask Language Understanding) — sets the capability floor for → Contrastive Activation Addition (CAA)
- Post-hoc (inference-time) steering mitigation — is checked against → MMLU (Massive Multitask Language Understanding)
- MMLU (Massive Multitask Language Understanding) — tests a different competence than → SuperGLUE hindsight
MMLU closes the suite as the one benchmark reused rather than merely paralleled: Steering Llama 2 via Contrastive Activation Addition (2023) runs the same 57-subject battery spanning science, technology, humanities, and social sciences against its own intervention, reporting the model's average probability of the correct answer under positive and negative steering multipliers. It finds no significant change, evidence that CAA's activation-space steering leaves general capability intact even as it moves a targeted behavior, the same capability-floor role this suite played for InstructGPT's alignment tax.
Chapter 5What it cost, and what still fails (5 sections)
The paper names the cost of its own method: an alignment tax, measurable regressions on public NLP benchmarks introduced as a side effect of RLHF, which PPO-ptx exists to pay down (instructgpt, §"4.2 Results on public NLP datasets", p. 14). The qualitative failures are just as specific. The model hallucinates less than GPT-3 — 21% versus 41% on closed-domain tasks — but still does; it hedges excessively on simple questions, apparently because labelers were instructed to reward epistemic humility and the reward model learned that preference too well; and it accepts false premises embedded in instructions instead of correcting them (instructgpt, §"4.3 Qualitative results", p. 16). The chapter's claim is the paper's own closing honesty: RLHF works, but not without residue — and several of the failures trace to the training data rather than to the optimizer, which is why the proposed fixes go there too.
The alignment tax concept (3 connections)
The paper coins a name for the cost of aligning a model, and argues keeping the tax low is itself a safety concern: an alignment technique that makes models worse will not be adopted (instructgpt, §"4.2 Results on public NLP datasets", p. 14).
connections
- MMLU (Massive Multitask Language Understanding) — reruns the question behind → Alignment tax hindsight
- Preventative steering — answers → Alignment tax hindsight
- Reward model over-optimization — demands a different mitigation than → Alignment tax
Hallucination, halved but present concept (4 connections)
Measured through a binary labeler-annotated field: 21% of closed-domain outputs versus GPT-3's 41% — a large improvement the paper declines to call a solution (instructgpt, §"3.6 Evaluation", p. 10).
connections
- Custom hallucination contrastive dataset — partitions into subtypes of → Hallucination (closed-domain fabrication)
- Hallucination (closed-domain fabrication) — sits in tension with → Excessive hedging on simple questions
- Hallucination (closed-domain fabrication) — is validated out of distribution on → HaluEval
- Trait-eliciting finetuning datasets (Evil, Sycophancy, Hallucination) — unintentionally amplifies → Hallucination (closed-domain fabrication)
Hedging as over-learned caution concept (5 connections)
Long, noncommittal answers to questions with a clear single answer — the paper's hypothesis is that its own labeling instructions rewarded epistemic humility and the reward model picked that up (instructgpt, §"4.3 Qualitative results", p. 16).
connections
- Excessive hedging on simple questions — is the harmlessness axis mirror of → Evasiveness hindsight
- Excessive hedging on simple questions — shares a fix but not a cause with → Failure to detect false-premise instructions
- Goodhart's law — operates at the subfeature level in → Excessive hedging on simple questions hindsight
- Hallucination (closed-domain fabrication) — sits in tension with → Excessive hedging on simple questions
- Reward model over-optimization — surfaces as → Excessive hedging on simple questions
Swallowing false premises concept (1 connection)
Given an instruction that assumes something false, the model plays along rather than pushing back; the proposed fix is adversarial data collection, not a change to the optimizer (instructgpt, §"4.3 Qualitative results", p. 16).
connections
- Excessive hedging on simple questions — shares a fix but not a cause with → Failure to detect false-premise instructions
The full ledger of failure modes theme (6 concepts)
All five documented shortfalls in one place, including reward-model over-optimization, the general mechanism behind several of them.
Reward model over-optimization (5 connections)
- Reward model over-optimization — demands a different mitigation than → Alignment tax
- Reward model over-optimization — surfaces as → Excessive hedging on simple questions
- Goodhart's law — is empirically instantiated by → Reward model over-optimization hindsight
- Reward model over-optimization — is preemptively countered by → Per-token KL penalty from the SFT model
- Pong (Atari game) — anticipates → Reward model over-optimization hindsight
Reward-model over-optimization is the general mechanism behind several of this theme's failures: an RL policy exploiting imperfections in a learned reward model to produce outputs that score well without being genuinely preferred by humans. The next several concepts are concrete surface symptoms of, or cross-cutting costs alongside, this one underlying mechanism.
Excessive hedging on simple questions (5 connections)
- Excessive hedging on simple questions — is the harmlessness axis mirror of → Evasiveness hindsight
- Excessive hedging on simple questions — shares a fix but not a cause with → Failure to detect false-premise instructions
- Goodhart's law — operates at the subfeature level in → Excessive hedging on simple questions hindsight
- Hallucination (closed-domain fabrication) — sits in tension with → Excessive hedging on simple questions
- Reward model over-optimization — surfaces as → Excessive hedging on simple questions
Excessive hedging is the clearest concrete instance of that mechanism: labelers were instructed to reward epistemic humility, so the reward model picked up a preference for long, noncommittal answers listing multiple possibilities even to questions with a fairly clear single answer, and reward-model over-optimization then surfaces as exactly this behavior.
Hallucination (closed-domain fabrication) (4 connections)
- Custom hallucination contrastive dataset — partitions into subtypes of → Hallucination (closed-domain fabrication)
- Hallucination (closed-domain fabrication) — sits in tension with → Excessive hedging on simple questions
- Hallucination (closed-domain fabrication) — is validated out of distribution on → HaluEval
- Trait-eliciting finetuning datasets (Evil, Sycophancy, Hallucination) — unintentionally amplifies → Hallucination (closed-domain fabrication)
Hallucination sits in tension with excessive hedging, the two bracket a single behavioral dial for how readily the model asserts things it cannot fully support. InstructGPT's headline truthfulness win, hallucinating on closed-domain tasks about half as often as GPT-3, sits at one end of that dial, while hedging sits at the other.
Sycophancy (6 connections)
- Sycophancy — instantiates → Goodhart's law hindsight
- Sycophancy — misgeneralizes the training objective of → Reinforcement learning from human feedback (RLHF) hindsight
- Sycophancy — is a behavioral instance of → Reward hacking (avoiding) hindsight
- Sycophancy dataset (Nishimura-Gasparian et al., 2024) — supplies training and validation questions for → Sycophancy
- Sycophancy on NLP Survey / Sycophancy on Political Typology datasets — supplies contrast pairs for → Sycophancy
- Sycophancy — is tested via → TruthfulQA hindsight
Sycophancy joins hallucination and hedging as a third behavioral failure, but Steering Llama 2 via Contrastive Activation Addition (2023) finds it in a different RLHF-trained model: prioritizing agreement with or flattery of the user over honesty and accuracy in Llama 2 Chat, evidence the failure is not specific to InstructGPT's training run. Unlike hallucination and hedging, though, this one is not stuck at training time: the same paper shows it can be dialed back down after training finishes, at inference, by subtracting a steering vector from the model's activations.
Failure to detect false-premise instructions (1 connection)
- Excessive hedging on simple questions — shares a fix but not a cause with → Failure to detect false-premise instructions
False-premise failure, accepting a false premise embedded in an instruction as true rather than correcting it, is presented alongside excessive hedging as one of the paper's simple mistakes, but the two share a fix without sharing a cause: hedging is an error the training signal actively rewards, while this failure has a different origin.
Alignment tax (3 connections)
- MMLU (Massive Multitask Language Understanding) — reruns the question behind → Alignment tax hindsight
- Preventative steering — answers → Alignment tax hindsight
- Reward model over-optimization — demands a different mitigation than → Alignment tax
Alignment tax closes the theme by naming the cost of this whole endeavor in a different currency: measurable regressions on public NLP benchmarks that RLHF fine-tuning introduces as a side effect of steering toward instruction-following. It demands a different mitigation than reward-model over-optimization does, the same underlying training pressure produces two separate diseases that the paper treats with two separate cures.
InstructGPT sits in the middle of this corpus's timeline, and almost everything in it points backward or forward. Backward: two proposals from the 2016 agenda paper and nearly every part of the 2017 preference-learning system reappear here, hardened into production form. Forward: Constitutional AI takes this exact pipeline as its base and swaps out the human labeler.
The chapters group those connections by era — what 2016 proposed, what 2017 built, what 2022 extends — and close with the motifs that only become visible when the papers are read side by side.
Read at
What InstructGPT inherits and what it hands on (4 chapters)
Forty-eight cross-paper edges run through InstructGPT: it operationalizes the 2016 agenda's proposals, industrializes the 2017 recipe part by part, and supplies the base pipeline that Constitutional AI modifies at exactly one point.
Chapter 1Cashing in the 2016 agenda (4 sections)
Two of Concrete Problems' proposals become, six years later, load-bearing stages of this paper's pipeline — and neither paper draws the connection itself. Use demonstrations, a 2016 suggestion for avoiding specification failures, arrives as supervised fine-tuning, stripped of the reward-inference machinery the agenda imagined around it. Scalable oversight, named in 2016 as an open problem, is retroactively answered by the reward model: a cheap learned proxy standing in for human judgment too expensive to collect on every training example. And Goodhart's law, stated abstractly in 2016, gets its clearest empirical instantiations here, from aggregate reward-model over-optimization down to hedging on a single over-learned subfeature.
A proposal becomes a pipeline stage 2016 edge
The 2016 remedy arrives in its structurally simplest form: no inverse RL, no reward inference, just supervised learning on 13k demonstrations. What survives is the core wager that showing the behavior can substitute for specifying it.
The open problem, answered sideways 2016 edge
Neither the 2016 paper nor InstructGPT states this match — it becomes visible only once Constitutional AI names reward models as scaled supervision. The reward model checks every training example so humans do not have to.
Goodhart's law, instantiated at two levels 2016 connective theme (7 edges)
The abstract 2016 principle acquires named instances in this paper: over-optimization at the aggregate level, excessive hedging one level down — while the word 'Goodharting' itself waits for Constitutional AI to be said aloud.
member edges
- Goodhart's law — is empirically instantiated by → Reward model over-optimization hindsight
- Pong (Atari game) — anticipates → Reward model over-optimization hindsight
- Goodhart's law — operates at the subfeature level in → Excessive hedging on simple questions hindsight
- Goodhart's law — is instantiated through mislabeled proxy in → Evasiveness hindsight
- Reward model over-optimization — surfaces as → Excessive hedging on simple questions
- Sycophancy — instantiates → Goodhart's law hindsight
- Sycophancy — misgeneralizes the training objective of → Reinforcement learning from human feedback (RLHF) hindsight
The full lineage, 2016 to 2022 theme (9 concepts)
The corpus's longest throughline — open problem, prototype, pipeline, AI feedback — with InstructGPT as the step where it stops being research and starts being production.
Scalable oversight (4 connections)
- Scalable oversight — is addressed by adapting → Distant supervision
- Scalable oversight — is addressed by → Hierarchical reinforcement learning (HRL)
- Scalable oversight — is retroactively operationalized by → Reward model (RM) hindsight
- Scalable oversight — is operationalized as → Semi-supervised reinforcement learning
Scalable oversight is named as an open problem in 2016: safe behavior requires evaluating a true objective too costly to check on every training example, forcing reliance on cheaper proxies. This walk now traces how a 2017 paper answers that problem directly, before the answer is scaled twice more, first into a language-model pipeline and then into an AI-fed variant of that same pipeline.
Asynchronous Reward-Learning Architecture (3 connections)
- Asynchronous Reward-Learning Architecture — gives concrete shape to → Reinforcement learning from human feedback (RLHF)
- Asynchronous Reward-Learning Architecture — trades its concurrency for a fixed dataset in → Reward model (RM) hindsight
- Reward Predictor Pretraining — solves the cold start problem of → Asynchronous Reward-Learning Architecture
The 2017 paper's asynchronous reward-learning architecture is scalable oversight's first concrete answer: a policy, a human-comparison process, and a reward predictor run as three concurrent loops, each feeding the next, so a learned reward can stand in for the missing objective while the policy trains. Trajectories flow into comparisons and comparisons into reward-predictor training, letting human judgment guide learning without ever evaluating the true objective on every step.
Human-Feedback Sample Efficiency (2 connections)
- Compute vs. Human Feedback Cost Analysis — caps the marginal value of → Human-Feedback Sample Efficiency
- Contractor Preference-Labeling Protocol — grounds the headline efficiency claim of → Human-Feedback Sample Efficiency
Human-feedback sample efficiency is the architecture's headline payoff: it makes the answer credible by learning complex tasks and novel behaviors from feedback on less than 1% of the agent's environment interactions, roughly three orders of magnitude less than feedback on every timestep. That efficiency is what turns asynchronous reward learning from a plausible idea into something practically deployable at deep-RL scale.
Reward model (RM) (11 connections)
- Adaptive L2 Regularization for the Reward Predictor — bounds the generalization gap of → Reward model (RM)
- Asynchronous Reward-Learning Architecture — trades its concurrency for a fixed dataset in → Reward model (RM) hindsight
- Bradley-Terry Model — supplies the loss for → Reward model (RM)
- Reward model (RM) — is overbuilt in anticipation of → Novel Behavior Training
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Recurrent Reward Model (Proposed Extension) — would generalize the fixed window of → Reward model (RM)
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Reward model pairwise comparison loss — under determines the scale of → Reward model (RM)
- Reward Prediction Normalization — fixes the underdetermined scale of → Reward model (RM)
- Scalable oversight — is retroactively operationalized by → Reward model (RM) hindsight
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
InstructGPT's (2022) reward model is, functionally, that same architecture scaled to language five years later: a model trained to predict which of two outputs human labelers would prefer, in place of the 2017 paper's video-clip comparisons. InstructGPT never uses the term scalable oversight, so the continuity is visible only in hindsight, but the underlying move, a learned proxy standing in for an objective too costly to check directly, is the one the 2017 architecture already made.
Reinforcement learning from human feedback (RLHF) (6 connections)
- Asynchronous Reward-Learning Architecture — gives concrete shape to → Reinforcement learning from human feedback (RLHF)
- Base vs. RLHF-chat model representation comparison — measures the effect of → Reinforcement learning from human feedback (RLHF) hindsight
- Contrastive Activation Addition (CAA) — operates on top of → Reinforcement learning from human feedback (RLHF) hindsight
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Reinforcement learning from human feedback (RLHF) — swaps the labeler in → RL from AI Feedback (RLAIF)
- Sycophancy — misgeneralizes the training objective of → Reinforcement learning from human feedback (RLHF) hindsight
RLHF is the fine-tuning technique the reward model exists to serve: its architecture and role are dictated by how policy optimization actually works, since it starts from the same weights as the policy it will later steer and anchors the reward signal RLHF optimizes against. Where the 2017 paper's three processes updated continuously and asynchronously, RLHF alternates reward-model training and policy optimization in discrete rounds, but the underlying loop is the one that architecture first ran end to end.
RL from AI Feedback (RLAIF) (4 connections)
- RL from AI Feedback (RLAIF) — delegates harmlessness comparisons to → Feedback Model
- RL from AI Feedback (RLAIF) — makes newly automatable → Iterated (Online) Training
- Open-ended generation evaluation with GPT-4 rating — shares the ai judge move with → RL from AI Feedback (RLAIF) hindsight
- Reinforcement learning from human feedback (RLHF) — swaps the labeler in → RL from AI Feedback (RLAIF)
RLAIF swaps the labeler in RLHF, replacing the human who produces preference comparisons with an AI system, while Constitutional AI states plainly that the remainder of the pipeline, preference model training and RL, is exactly the same as RLHF. It is a minimal, surgical modification, not a new algorithm, pushing the same lineage one step further toward automation.
Feedback Model (4 connections)
- Feedback Model — supplies the harmlessness half of → Hybrid Human/AI Preference Model
- Multiple-Choice Comparison Format — turns into a preference labeler → Feedback Model
- Principle Ensembling — makes more robust → Feedback Model
- RL from AI Feedback (RLAIF) — delegates harmlessness comparisons to → Feedback Model
The feedback model is what RLAIF delegates harmlessness comparisons to: an independent language model shown a harmful prompt and a pair of responses, formatted as an explicit multiple-choice question, that produces the preference label a human labeler, or the 2017 paper's human overseer, would have produced before. It is the concrete mechanism that makes RLAIF's labeler-swap actually work.
Hybrid Human/AI Preference Model (1 connection)
- Feedback Model — supplies the harmlessness half of → Hybrid Human/AI Preference Model
The hybrid human/AI preference model is trained on a mixture the feedback model makes possible: human-labeled helpfulness comparisons stitched together with AI-labeled harmlessness comparisons into a single reward signal. It shows the lineage does not have to be all-human or all-AI, human and machine judgment can be blended in the same trained model.
Iterated (Online) Training (4 connections)
- Label Annealing — paces the query rate within → Iterated (Online) Training
- Iterated (Online) Training — is the cause of → Non-Stationary Reward Function Challenge
- Iterated (Online) Training — guards against → Reward hacking (avoiding)
- RL from AI Feedback (RLAIF) — makes newly automatable → Iterated (Online) Training
Iterated online training, periodically refreshing the preference model with new comparisons on the current policy's own outputs, is not new at this last step: the 2017 paper's architecture already ran it as a core design choice, collecting comparisons continuously throughout training rather than only at the start. Constitutional AI (2022) flags the same technique as a further scaling step, now newly automatable once an AI rather than a human is doing the labeling, closing the lineage at the point where the labeler itself stops being the bottleneck.
Chapter 2The 2017 recipe, industrialized (6 sections)
Read pairwise with Deep RL from Human Preferences, InstructGPT is the same machine built at a different level of industrialization — 24 edges connect the two papers, more than any other pair in the corpus. Some parts carry over unchanged: the Bradley-Terry comparison mathematics of 1952 fits a language model's reward exactly as it fit a simulated robot's. Some are formalized: an unscreened contractor sign-up sheet becomes a four-criterion screening process, an ad hoc clip server becomes a purpose-built labeling interface, and an assumed ten-percent rater error rate becomes a measured agreement statistic. And some 2017 findings quietly anticipate 2022 problems: the Pong agent that rallied forever without scoring is reward over-optimization five years early, and the moving-reward problem the 2017 architecture was built around returns whenever InstructGPT's RM-then-PPO loop is iterated rather than run once.
Ad hoc parts, industrial replacements 2017 connective theme (12 edges)
Eight edges pair a 2017 part with its 2022 replacement, and what carries over unchanged is as informative as what gets rebuilt.
member edges
- Contractor Preference-Labeling Protocol — becomes a screened operation in → Labeler screening and selection process hindsight
- Contractor Preference-Labeling Protocol — is formalized as → Web labeling interface hindsight
- Bradley-Terry Model — is carried over unchanged into → Reward model pairwise comparison loss hindsight
- Asynchronous Reward-Learning Architecture — trades its concurrency for a fixed dataset in → Reward model (RM) hindsight
- Constant Rater-Error Noise Model — assumes a constant later measured by → Inter-labeler agreement rate hindsight
- Preference Elicitation Protocol — avoids the overfitting problem solved by → K-choose-2 single-batch comparison training hindsight
- Reward Prediction Normalization — prefigures the scale fix in → Reward model pairwise comparison loss hindsight
- Trajectory Segment — generalizes into → RM (comparison) dataset hindsight
- Response-conditioned contrastive vector computation — generalizes beyond the answer letter recipe of → CAA steering vector construction (Mean Difference over multiple-choice contrast pairs) hindsight
- Automated persona vector extraction pipeline — adds filtering and validation beyond → Automated concept-description-to-direction pipeline (Wu et al., 2025)
- Automated persona vector extraction pipeline — automates away the bespoke curation of → Contrastive Activation Addition (CAA) hindsight
- Trait expression score (LLM judge) — succeeds the sampled rating protocol of → Open-ended generation evaluation with GPT-4 rating hindsight
The reward model, a concept three papers share 2017 concept (11 connections)
One of the corpus's few concepts that literally lives in three papers: born in 2017 for robots and Atari, refined here into a 6B judge of language completions, then inherited whole by Constitutional AI.
connections
- Adaptive L2 Regularization for the Reward Predictor — bounds the generalization gap of → Reward model (RM)
- Asynchronous Reward-Learning Architecture — trades its concurrency for a fixed dataset in → Reward model (RM) hindsight
- Bradley-Terry Model — supplies the loss for → Reward model (RM)
- Reward model (RM) — is overbuilt in anticipation of → Novel Behavior Training
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Recurrent Reward Model (Proposed Extension) — would generalize the fixed window of → Reward model (RM)
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Reward model pairwise comparison loss — under determines the scale of → Reward model (RM)
- Reward Prediction Normalization — fixes the underdetermined scale of → Reward model (RM)
- Scalable oversight — is retroactively operationalized by → Reward model (RM) hindsight
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
1952 mathematics, carried over unchanged 2017 edge
The same paired-comparison softmax moves from ranking chess players to ranking robot backflips to ranking language completions without changing its form — the corpus's most durable single borrowing.
Pong's endless rally, redrawn at scale 2017 edge
The 2017 frozen-predictor ablation produced an agent that volleyed indefinitely and never scored: reward over-optimization in miniature, five years before InstructGPT drew the identical curve at language-model scale.
A grading method becomes a paradigm 2017 edge
The 2017 fallback for tasks with no reward function — ask a human whether the behavior fulfills a natural-language goal — is instruction following in embryo, a one-off evaluation trick that became a training objective.
The moving target, dormant not solved 2017 edge
InstructGPT's pipeline looks stationary only because the RM-then-PPO loop usually runs once; iterate it, as the paper notes it can be, and the 2017 problem returns intact.
Chapter 3The base Constitutional AI extends (6 sections)
Constitutional AI does not compete with this paper; it builds directly on top of it, and twenty edges record the inheritance. Its central move is explicitly surgical: RLHF's human labeler is swapped for a feedback model steered by a written Constitution (set of principles), and everything else — preference-model training, the RL stage — stays where InstructGPT left it. Its characteristic failure is a sibling of this paper's: Evasiveness is excessive hedging's mirror on the harmlessness axis, the same over-rewarded proxy wearing the opposite disguise. And its repair vindicates a diagnosis this paper could only gesture at: what fixed evasiveness was changing the labeling instructions, not tightening the KL penalty, confirming that this family of failures lives in the data. Even the measurement carries forward, with Elo scores generalizing this paper's win rate.
Swapping the labeler, keeping the pipeline 2022 edge
Constitutional AI's RLAIF changes exactly one component of this paper's recipe — who produces the preference labels — which is the strongest evidence of how standard the recipe had become.
Replacing the human at the bottleneck 2022 connective theme (11 edges)
The general pattern behind RLAIF: an AI process substitutes for a human one at precisely the point human throughput was scarce — the point this paper's forty contractors embody.
member edges
- Reinforcement learning from human feedback (RLHF) — swaps the labeler in → RL from AI Feedback (RLAIF)
- RL from AI Feedback (RLAIF) — delegates harmlessness comparisons to → Feedback Model
- RL from AI Feedback (RLAIF) — makes newly automatable → Iterated (Online) Training
- Constitution (set of principles) — replaces human harm labels in → Constitutional AI (CAI)
- Red Teaming — is the manual process that scales into → Automated Red Teaming
- Human oversight (safe exploration) — scalability limit motivates → Trusted policy oversight
- GPT-4 — rates outputs for → Open-ended generation evaluation with GPT-4 rating
- Open-ended generation evaluation with GPT-4 rating — shares the ai judge move with → RL from AI Feedback (RLAIF) hindsight
- GPT-4 — authors → Custom refusal contrastive dataset
- Claude Sonnet as pipeline/data-generation tool — authors the artifacts behind → Trait-specific artifact generation
- Trait expression score (LLM judge) — operationalizes its rubric through → GPT-4.1-mini
Two failures, one shape 2022 edge
InstructGPT over-rewards caution and gets verbose hedging; Constitutional AI over-rewards harmlessness and gets curt refusal. The same proxy failure runs in opposite surface directions.
The fix lives in the data 2022 connective theme (5 edges)
This paper proposed adversarial data collection, not more regularization, for its data-borne failures; Constitutional AI's actual repair of evasiveness — changing what labelers were asked to prefer — proves the diagnosis right.
member edges
- Per-token KL penalty from the SFT model — was not the fix applied to → Evasiveness hindsight
- Reward model over-optimization — surfaces as → Excessive hedging on simple questions
- Excessive hedging on simple questions — shares a fix but not a cause with → Failure to detect false-premise instructions
- Ant (MuJoCo task) — hard codes an upright priority into → Contractor Preference-Labeling Protocol
- Real-world chat data validation of persona vectors — validates against → LMSYS-Chat-1M
A shared definition of aligned 2022 concept (2 connections)
Both papers define an aligned model the same way — helpful, honest, harmless, adapted from Askell et al. — one vocabulary coined once and used across the 2022 pair.
connections
- Evil (persona trait) — inverts the baseline encoded by → Helpful, honest, harmless (HHH) alignment framework hindsight
- Helpful, honest, harmless (HHH) alignment framework — is operationalized as → HHH Evaluation Set (binary comparisons)
Win rate grows into Elo 2022 edge
This paper's single-anchor preference metric becomes Constitutional AI's Elo score, ranking many model snapshots at once — the measuring instrument evolving alongside the pipeline it measures.
Chapter 4Motifs that only appear side by side (5 tissues)
Some of the strongest connections are not paper-to-paper links but patterns that recur wherever the corpus builds a pipeline, and InstructGPT sits inside all of them. The scale asymmetry behind the headline result — a small judge steering a large policy, a small model beating one a hundred times larger — repeats at every stage and in every paper. The pipeline that reads as a forward sequence turns out to run causality backward, with the reward model back-selecting the SFT checkpoint that precedes it. Every primary metric travels with a second instrument built to catch what the first cannot see. And nineteen edges in the store are pure hindsight — connections no source paper states, visible only because the papers can now be read against each other.
Small things steering big things connective theme (9 edges)
The 100x headline rests on asymmetries repeated all the way down: a 6B reward model supervising a 175B policy, and later ten constitutional principles standing in for tens of thousands of labels.
member edges
- InstructGPT — outperforms at 100x smaller scale → GPT-3 (pretrained language model)
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Constitution (set of principles) — replaces human harm labels in → Constitutional AI (CAI)
- API prompt distribution — supplies label free scale to → PPO dataset
- T0 (instruction-tuned baseline) — is scaled to match → FLAN (instruction-tuned baseline)
- FLAN (instruction-tuned baseline) — sets the comparison floor for → Instruction following (as a fine-tuning objective)
- GPT-3 (prompted) baseline — shows the limits of prompting alone for → Instruction following (as a fine-tuning objective)
- Advantage Actor-Critic (A2C/A3C) — closes its enduro exploration gap with → Deep Q-Network (DQN)
- Few-shot prompting — loses out to → System-prompting
Each stage engineers the next stage's input connective theme (12 edges)
The SFT dataset shapes what the reward model can competently judge, the interface's encouraged ties filter what RM training sees, and the API prompts supply label-free scale to PPO — no stage is a neutral conduit.
member edges
- Trajectory Segment — supplies the comparison unit for → Preference Elicitation Protocol
- SFT dataset — trains the policies sampled for → RM (comparison) dataset
- Web labeling interface — filters uncertain comparisons out of → RM (comparison) dataset
- API prompt distribution — supplies label free scale to → PPO dataset
- Critique and Revision — supplies the finetuning data for → SL-CAI (Supervised-Learning Constitutional AI model)
- SL-CAI (Supervised-Learning Constitutional AI model) — seeds the policy and comparison data for → RL-CAI (RLAIF-trained Constitutional AI model)
- Feedback Model — supplies the harmlessness half of → Hybrid Human/AI Preference Model
- Red Teaming — supplies the transcripts for → Harmful Behavior Identification/Classification Evaluations (Appendix B)
- Trait-specific artifact generation — supplies the raw materials for → Response-conditioned contrastive vector computation
- Response-conditioned contrastive vector computation — supplies manufactured contrast sets to → Mean Difference (MD) vector extraction
- Trait-specific artifact generation — generates the scoring rubric consumed by → Trait expression score (LLM judge)
- Response-conditioned contrastive vector computation — filters its rollouts by → Trait expression score (LLM judge)
The diagram lies about causality connective theme (8 edges)
The three-step figure reads left to right, but the reward model back-selects the SFT checkpoint behind it, and the SFT dataset bootstrapped the very prompt distribution the paper is evaluated on.
member edges
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
- SFT dataset — bootstrapped the existence of → API prompt distribution
- SFT dataset — trains the policies sampled for → RM (comparison) dataset
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Supervised fine-tuned (SFT) model — anchors as both init and reference for → PPO fine-tuning stage (RLHF policy optimization)
- Few-shot Prompts for SL-CAI (Appendix E.1) — prevents role confusion in → Critique and Revision
- SL-CAI (Supervised-Learning Constitutional AI model) — seeds the policy and comparison data for → RL-CAI (RLAIF-trained Constitutional AI model)
- Reward model (RM) — is overbuilt in anticipation of → Novel Behavior Training
A metric and its audit connective theme (18 edges)
Win rate travels with Likert ratings that corroborate it, agreement rates that cap its resolution, and held-out labelers that test its reach — a primary signal paired with an independent check, a shape the whole corpus repeats.
member edges
- Inter-labeler agreement rate — caps the resolution of → Win rate (preference against baseline)
- Likert overall-quality rating — corroborates → Win rate (preference against baseline)
- Elo Score (helpfulness/harmlessness) — generalizes → Win rate (preference against baseline) hindsight
- Absolute Harmfulness Score — cross checks → Elo Score (helpfulness/harmlessness)
- PALMS (Process for Adapting Language Models to Society) — provides an independent check outside → Red Teaming
- RealToxicityPrompts — diverges under respectful prompting from → Winogender
- Labeler screening and selection process — creates the question answered by → Held-out labeler generalization test
- Inter-labeler agreement rate — was both filter and audit for → Labeler screening and selection process
- Constant Rater-Error Noise Model — assumes a constant later measured by → Inter-labeler agreement rate hindsight
- Reward model pairwise comparison loss — under determines the scale of → Reward model (RM)
- Synthetic Oracle Feedback — is only realizable within → Quantitative vs. Qualitative Evaluation Methodology
- Open-ended generation evaluation with GPT-4 rating — shows a different margin than → Multiple-choice behavioral evaluation and layer sweep
- MMLU (Massive Multitask Language Understanding) — tests a different competence than → SuperGLUE hindsight
- Coherence score — guards the capability floor for → Trait expression score (LLM judge)
- Hallucination (closed-domain fabrication) — is validated out of distribution on → HaluEval
- Projection-based monitoring of prompt-induced persona shifts — is benchmarked against → Trait expression score (LLM judge)
- Post-hoc (inference-time) steering mitigation — is checked against → MMLU (Massive Multitask Language Understanding)
- Steering-based mitigation of finetuning-induced persona shifts — is bounded by → Coherence score
Nineteen connections nobody drew connective theme (23 edges)
The edges flagged as hindsight links exist only because a later paper can be read against an earlier one — and more of them run through InstructGPT than through any other paper.
member edges
- Goodhart's law — is empirically instantiated by → Reward model over-optimization hindsight
- Goodhart's law — operates at the subfeature level in → Excessive hedging on simple questions hindsight
- Goodhart's law — is instantiated through mislabeled proxy in → Evasiveness hindsight
- Excessive hedging on simple questions — is the harmlessness axis mirror of → Evasiveness hindsight
- Per-token KL penalty from the SFT model — was not the fix applied to → Evasiveness hindsight
- Use demonstrations (safe exploration) — operationalized as → Supervised fine-tuning (SFT) hindsight
- Scalable oversight — is retroactively operationalized by → Reward model (RM) hindsight
- Elo Score (helpfulness/harmlessness) — generalizes → Win rate (preference against baseline) hindsight
- Pong (Atari game) — anticipates → Reward model over-optimization hindsight
- Quantitative vs. Qualitative Evaluation Methodology — prefigures → Instruction following (as a fine-tuning objective) hindsight
- Non-Stationary Reward Function Challenge — resurfaces under iteration in → PPO fine-tuning stage (RLHF policy optimization) hindsight
- Constant Rater-Error Noise Model — assumes a constant later measured by → Inter-labeler agreement rate hindsight
- Contractor Preference-Labeling Protocol — becomes a screened operation in → Labeler screening and selection process hindsight
- Contractor Preference-Labeling Protocol — is formalized as → Web labeling interface hindsight
- Bradley-Terry Model — is carried over unchanged into → Reward model pairwise comparison loss hindsight
- Asynchronous Reward-Learning Architecture — trades its concurrency for a fixed dataset in → Reward model (RM) hindsight
- Trajectory Segment — generalizes into → RM (comparison) dataset hindsight
- Reward Prediction Normalization — prefigures the scale fix in → Reward model pairwise comparison loss hindsight
- Preference Elicitation Protocol — avoids the overfitting problem solved by → K-choose-2 single-batch comparison training hindsight
- Few-shot prompting — shares its mechanism with → GPT-3 (prompted) baseline hindsight
- Evil (persona trait) — inverts the baseline encoded by → Helpful, honest, harmless (HHH) alignment framework hindsight
- Supervised fine-tuning (SFT) — is the mechanism that produces → Finetuning shift (activation-shift metric)
- Preventative steering — answers → Alignment tax hindsight
The corpus's first built system: two of the 2016 proposals — learn the objective from human feedback, and supervise it at a scale no human could label by hand — become a working three-stage pipeline. Read the refined shelf first, because it carries the story: supervised fine-tuning, the reward model, RLHF itself, and instruction following all existed before this paper, and it is here that they harden into the standard recipe. The introduced shelf is mostly the parts the recipe needed to actually run — the three datasets, the K-choose-2 comparison trick, PPO-ptx — plus the measurement apparatus around the labelers and the newly named costs of aligning a model, from the alignment tax to hedging and false-premise failures. The inherited shelf shows what the pipeline stands on: GPT-3, PPO, and the public NLP benchmarks the aligned models are scored against.
Read at
Introduced here introduced (16 concepts, in reading order)
InstructGPT (1 connection) §“Abstract”, p. 1
- InstructGPT — outperforms at 100x smaller scale → GPT-3 (pretrained language model)
The family of GPT-3 models fine-tuned with the paper's three-step demonstration-plus-RLHF pipeline, referred to by default as the PPO-ptx model unless otherwise specified.API prompt distribution (2 connections) §“3.2 Dataset”, p. 6
- API prompt distribution — supplies label free scale to → PPO dataset
- SFT dataset — bootstrapped the existence of → API prompt distribution
The paper's primary prompt source: text prompts submitted by external users to an earlier, demonstration-only InstructGPT model on the OpenAI Playground, deduplicated, capped per user, and filtered for personally identifiable information.PPO dataset (1 connection) §“3.2 Dataset”, p. 7
- API prompt distribution — supplies label free scale to → PPO dataset
The set of about 31k API-only prompts, without any human labels, used as rollout inputs for RLHF fine-tuning.RM (comparison) dataset (3 connections) §“3.2 Dataset”, p. 7
- SFT dataset — trains the policies sampled for → RM (comparison) dataset
- Trajectory Segment — generalizes into → RM (comparison) dataset hindsight
- Web labeling interface — filters uncertain comparisons out of → RM (comparison) dataset
The set of about 33k training prompts, each with K=4 to 9 model outputs ranked by labelers, used to train the reward model.SFT dataset (3 connections) §“3.2 Dataset”, p. 7
- SFT dataset — bootstrapped the existence of → API prompt distribution
- SFT dataset — trains the policies sampled for → RM (comparison) dataset
- SFT dataset — duplication underlies early overfitting of → Supervised fine-tuned (SFT) model
The set of about 13k training prompts (labeler-written and API-sourced) paired with human demonstrations, used to train the supervised fine-tuned models.Held-out labeler generalization test (1 connection) §“3.4 Human data collection”, p. 8
- Labeler screening and selection process — creates the question answered by → Held-out labeler generalization test
An experiment measuring whether models and reward models trained on one group of labelers' preferences generalize to a separate group of labelers who contributed no training data, via both a held-out labeler evaluation and 5-fold cross-validated reward models.K-choose-2 single-batch comparison training (1 connection) §“3.5 Models”, p. 8
- Preference Elicitation Protocol — avoids the overfitting problem solved by → K-choose-2 single-batch comparison training hindsight
A reward-model training trick that places all C(K,2) pairwise comparisons from one labeled ranking of K outputs into a single batch element, avoiding the overfitting that results from treating correlated comparisons as independent shuffled data points.- Labeler metadata annotation taxonomy §“3.6 Evaluation”, p. 9A fixed set of binary and Likert-scale metadata fields (e.g., fails to follow instruction, hallucination, denigrates a protected class, contains sexual/violent content) that labelers record for each rated output.
PPO (without pretraining mix) (1 connection) §“3.5 Models”, p. 9
- PPO-ptx (pretraining gradient mixing) — diverges only off distribution from → PPO (without pretraining mix)
The RLHF policy variant trained purely to maximize reward-model score plus a KL penalty, with the pretraining-gradient coefficient set to zero, used as an ablation against PPO-ptx.PPO-ptx (pretraining gradient mixing) (2 connections) §“3.5 Models”, p. 9
- PPO-ptx (pretraining gradient mixing) — outperforms tightening of → Per-token KL penalty from the SFT model
- PPO-ptx (pretraining gradient mixing) — diverges only off distribution from → PPO (without pretraining mix)
A modification of PPO fine-tuning that mixes gradients from the language-modeling loss on the pretraining distribution into the PPO updates, to counteract performance regressions on public NLP tasks.Alignment tax (3 connections) §“4.2 Results on public NLP datasets”, p. 14
- MMLU (Massive Multitask Language Understanding) — reruns the question behind → Alignment tax hindsight
- Preventative steering — answers → Alignment tax hindsight
- Reward model over-optimization — demands a different mitigation than → Alignment tax
The performance cost, in terms of regressions on public NLP benchmarks, incurred as a side effect of an alignment fine-tuning procedure such as RLHF.Excessive hedging on simple questions (5 connections) §“4.3 Qualitative results”, p. 16
- Excessive hedging on simple questions — is the harmlessness axis mirror of → Evasiveness hindsight
- Excessive hedging on simple questions — shares a fix but not a cause with → Failure to detect false-premise instructions
- Goodhart's law — operates at the subfeature level in → Excessive hedging on simple questions hindsight
- Hallucination (closed-domain fabrication) — sits in tension with → Excessive hedging on simple questions
- Reward model over-optimization — surfaces as → Excessive hedging on simple questions
A qualitative failure mode in which InstructGPT gives long, non-committal answers listing multiple possibilities to simple questions that have a fairly clear single answer.Failure to detect false-premise instructions (1 connection) §“4.3 Qualitative results”, p. 16
- Excessive hedging on simple questions — shares a fix but not a cause with → Failure to detect false-premise instructions
A qualitative failure mode in which the model incorrectly assumes a false premise embedded in an instruction is true and answers as if it were, rather than correcting it.Labeler screening and selection process (3 connections) §“B.1 Labeler selection”, p. 36
- Contractor Preference-Labeling Protocol — becomes a screened operation in → Labeler screening and selection process hindsight
- Labeler screening and selection process — creates the question answered by → Held-out labeler generalization test
- Inter-labeler agreement rate — was both filter and audit for → Labeler screening and selection process
A four-criterion screening procedure (agreement on sensitive-speech flagging, agreement on rankings, sensitive demonstration writing quality, and self-assessed ability to identify sensitive content across groups) used to select the roughly 40 contractors who produced the paper's training data.Web labeling interface (2 connections) §“B.5 Web interface”, p. 38
- Contractor Preference-Labeling Protocol — is formalized as → Web labeling interface hindsight
- Web labeling interface — filters uncertain comparisons out of → RM (comparison) dataset
The internal web tool used by labelers and researchers to assign Likert quality scores, metadata labels, and full rankings to sets of model outputs for a given prompt.Entropy-based bias metric (2 connections) §“D.1 Toxicity and bias evaluation details”, p. 44
- Entropy-based bias metric — strips the direction from → CrowS-Pairs
- Entropy-based bias metric — recasts the task of → Winogender
A bias measurement that converts a model's relative probability of producing each sentence in a Winogender/CrowS-Pairs pair into a binary distribution and reports its entropy in bits, where lower entropy indicates stronger (more biased) preference for one completion.
Refined here refined (6 concepts, in reading order)
Instruction following (as a fine-tuning objective) (4 connections) §“1 Introduction”, p. 1
- FLAN (instruction-tuned baseline) — sets the comparison floor for → Instruction following (as a fine-tuning objective)
- GPT-3 (prompted) baseline — shows the limits of prompting alone for → Instruction following (as a fine-tuning objective)
- Language modeling (next-token prediction) objective — is argued to be misaligned with → Instruction following (as a fine-tuning objective)
- Quantitative vs. Qualitative Evaluation Methodology — prefigures → Instruction following (as a fine-tuning objective) hindsight
The capability of a language model to carry out natural-language task instructions across an open-ended range of tasks, which this paper trains and measures directly via RLHF on real user-submitted prompts rather than via a fixed compilation of formatted NLP tasks.Reinforcement learning from human feedback (RLHF) (6 connections) §“1 Introduction”, p. 2
- Asynchronous Reward-Learning Architecture — gives concrete shape to → Reinforcement learning from human feedback (RLHF)
- Base vs. RLHF-chat model representation comparison — measures the effect of → Reinforcement learning from human feedback (RLHF) hindsight
- Contrastive Activation Addition (CAA) — operates on top of → Reinforcement learning from human feedback (RLHF) hindsight
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Reinforcement learning from human feedback (RLHF) — swaps the labeler in → RL from AI Feedback (RLAIF)
- Sycophancy — misgeneralizes the training objective of → Reinforcement learning from human feedback (RLHF) hindsight
A fine-tuning technique that uses a learned model of human preferences as a reward signal for reinforcement learning, applied here to align GPT-3 to follow a broad, open-ended distribution of natural-language instructions.Reward model (RM) (11 connections) §“3.5 Models”, p. 8
- Adaptive L2 Regularization for the Reward Predictor — bounds the generalization gap of → Reward model (RM)
- Asynchronous Reward-Learning Architecture — trades its concurrency for a fixed dataset in → Reward model (RM) hindsight
- Bradley-Terry Model — supplies the loss for → Reward model (RM)
- Reward model (RM) — is overbuilt in anticipation of → Novel Behavior Training
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Recurrent Reward Model (Proposed Extension) — would generalize the fixed window of → Reward model (RM)
- Reward model (RM) — anchors the reward signal of → Reinforcement learning from human feedback (RLHF)
- Reward model pairwise comparison loss — under determines the scale of → Reward model (RM)
- Reward Prediction Normalization — fixes the underdetermined scale of → Reward model (RM)
- Scalable oversight — is retroactively operationalized by → Reward model (RM) hindsight
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
A model initialized from the SFT model with its unembedding layer replaced by a scalar output head, trained to predict which of two model outputs human labelers would prefer.Supervised fine-tuned (SFT) model (3 connections) §“3.5 Models”, p. 8
- Supervised fine-tuned (SFT) model — anchors as both init and reference for → PPO fine-tuning stage (RLHF policy optimization)
- Reward model (RM) — back selects the checkpoint of → Supervised fine-tuned (SFT) model
- SFT dataset — duplication underlies early overfitting of → Supervised fine-tuned (SFT) model
A GPT-3 model fine-tuned on labeler demonstrations via supervised learning, used both as a standalone baseline and as the initialization for reward-model and PPO training.GPT-3 (prompted) baseline (2 connections) §“3.5 Models”, p. 9
- Few-shot prompting — shares its mechanism with → GPT-3 (prompted) baseline hindsight
- GPT-3 (prompted) baseline — shows the limits of prompting alone for → Instruction following (as a fine-tuning objective)
GPT-3 given a hand-crafted few-shot prefix intended to coax it into an instruction-following mode, used as a stronger baseline than raw GPT-3.Hallucination (closed-domain fabrication) (4 connections) §“3.6 Evaluation”, p. 10
- Custom hallucination contrastive dataset — partitions into subtypes of → Hallucination (closed-domain fabrication)
- Hallucination (closed-domain fabrication) — sits in tension with → Excessive hedging on simple questions
- Hallucination (closed-domain fabrication) — is validated out of distribution on → HaluEval
- Trait-eliciting finetuning datasets (Evil, Sycophancy, Hallucination) — unintentionally amplifies → Hallucination (closed-domain fabrication)
The failure mode in which a model states information not present in, or unsupported by, the input on closed-domain tasks such as summarization or closed-domain QA.
Inherited — used, not invented here inherited (35 concepts, in reading order)
Helpful, honest, harmless (HHH) alignment framework (2 connections) §“1 Introduction”, p. 2
- Evil (persona trait) — inverts the baseline encoded by → Helpful, honest, harmless (HHH) alignment framework hindsight
- Helpful, honest, harmless (HHH) alignment framework — is operationalized as → HHH Evaluation Set (binary comparisons)
A framework, adapted from Askell et al. (2021), that defines an aligned model as one that is helpful (follows user intent), honest (does not fabricate or mislead), and harmless (avoids causing harm).Language modeling (next-token prediction) objective (1 connection) §“1 Introduction”, p. 2
- Language modeling (next-token prediction) objective — is argued to be misaligned with → Instruction following (as a fine-tuning objective)
The standard pretraining objective of predicting the next token on internet text, which the paper argues is misaligned with the objective of helpfully and safely following user instructions.DROP (Discrete Reasoning Over the content of Paragraphs) (2 connections) §“1 Introduction”, p. 3
- HellaSwag — escapes the regression that persists in → DROP (Discrete Reasoning Over the content of Paragraphs)
- SQuAD v2 — forms the regression testbed with → DROP (Discrete Reasoning Over the content of Paragraphs)
A reading-comprehension benchmark (Dua et al., 2019) requiring discrete reasoning (e.g., counting, sorting) over paragraphs, used as one of the public NLP datasets showing PPO regressions.HellaSwag (1 connection) §“1 Introduction”, p. 3
- HellaSwag — escapes the regression that persists in → DROP (Discrete Reasoning Over the content of Paragraphs)
A commonsense-reasoning benchmark (Zellers et al., 2019) requiring selection of the most plausible sentence continuation, used as one of the public NLP evaluation datasets.SQuAD v2 (1 connection) §“1 Introduction”, p. 3
- SQuAD v2 — forms the regression testbed with → DROP (Discrete Reasoning Over the content of Paragraphs)
A reading-comprehension QA benchmark (Rajpurkar et al., 2018) that includes unanswerable questions, used as one of the public NLP datasets showing PPO regressions.WMT 2015 French-to-English translation (1 connection) §“1 Introduction”, p. 3
- WMT 2015 French-to-English translation — bears the alignment tax that spares → Reddit TL;DR summarization
A machine-translation benchmark (Bojar et al., 2015) used as one of the public NLP datasets showing performance regressions under PPO fine-tuning.FLAN (instruction-tuned baseline) (2 connections) §“1 Introduction”, p. 4
- FLAN (instruction-tuned baseline) — sets the comparison floor for → Instruction following (as a fine-tuning objective)
- T0 (instruction-tuned baseline) — is scaled to match → FLAN (instruction-tuned baseline)
A compilation of NLP tasks with natural-language instructions (Wei et al., 2021) that the paper fine-tunes 175B GPT-3 on to produce a cross-task-instruction-tuning baseline for comparison against InstructGPT.T0 (instruction-tuned baseline) (1 connection) §“1 Introduction”, p. 4
- T0 (instruction-tuned baseline) — is scaled to match → FLAN (instruction-tuned baseline)
A compilation of NLP tasks with natural-language instructions (Sanh et al., 2021), specifically the T0++ variant, fine-tuned into a 175B GPT-3 baseline for comparison against InstructGPT.Supervised fine-tuning (SFT) (4 connections) §“3.1 High-level methodology”, p. 6
- CAA combined with supervised finetuning comparison — runs head to head against → Supervised fine-tuning (SFT)
- CAA vs. finetuning computational cost comparison — avoids the memory cost of → Supervised fine-tuning (SFT)
- Supervised fine-tuning (SFT) — is the mechanism that produces → Finetuning shift (activation-shift metric)
- Use demonstrations (safe exploration) — operationalized as → Supervised fine-tuning (SFT) hindsight
The first training step, in which a pretrained language model is fine-tuned directly on human-written demonstrations of desired output behavior using standard supervised learning.GPT-3 (pretrained language model) (1 connection) §“3.5 Models”, p. 8
- InstructGPT — outperforms at 100x smaller scale → GPT-3 (pretrained language model)
The autoregressive pretrained language model from Brown et al. (2020) that serves as the starting point and architecture for all SFT, reward, and PPO models in this paper.Inter-labeler agreement rate (3 connections) §“3.4 Human data collection”, p. 8
- Constant Rater-Error Noise Model — assumes a constant later measured by → Inter-labeler agreement rate hindsight
- Inter-labeler agreement rate — was both filter and audit for → Labeler screening and selection process
- Inter-labeler agreement rate — caps the resolution of → Win rate (preference against baseline)
The measured rate at which independent labelers agree with each other (or with researchers) when ranking or labeling the same outputs, used to validate the feasibility and consistency of the labeling task.Reward model pairwise comparison loss (3 connections) §“3.5 Models”, p. 8
- Bradley-Terry Model — is carried over unchanged into → Reward model pairwise comparison loss hindsight
- Reward model pairwise comparison loss — under determines the scale of → Reward model (RM)
- Reward Prediction Normalization — prefigures the scale fix in → Reward model pairwise comparison loss hindsight
A cross-entropy loss over pairs of ranked completions in which the reward difference between preferred and dispreferred outputs represents the log odds a human would prefer the former.Bandit environment formulation for RLHF (2 connections) §“3.5 Models”, p. 9
- Bandit environment formulation for RLHF — renders discounting moot in → Generalized advantage estimation (GAE)
- Per-token KL penalty from the SFT model — densifies the terminal reward of → Bandit environment formulation for RLHF
The RL environment used for PPO fine-tuning, in which a random customer prompt is presented, the policy produces one response, a reward is assigned by the reward model, and the episode ends immediately.Per-token KL penalty from the SFT model (4 connections) §“3.5 Models”, p. 9
- Per-token KL penalty from the SFT model — densifies the terminal reward of → Bandit environment formulation for RLHF
- Per-token KL penalty from the SFT model — was not the fix applied to → Evasiveness hindsight
- PPO-ptx (pretraining gradient mixing) — outperforms tightening of → Per-token KL penalty from the SFT model
- Reward model over-optimization — is preemptively countered by → Per-token KL penalty from the SFT model
A term subtracted from the reward at every generated token, proportional to the KL divergence between the RL policy and the SFT model, used to keep the policy close to the SFT model and limit reward over-optimization.PPO fine-tuning stage (RLHF policy optimization) (3 connections) §“3.5 Models”, p. 9
- Non-Stationary Reward Function Challenge — resurfaces under iteration in → PPO fine-tuning stage (RLHF policy optimization) hindsight
- Reward model (RM) — supervises from below → PPO fine-tuning stage (RLHF policy optimization)
- Supervised fine-tuned (SFT) model — anchors as both init and reference for → PPO fine-tuning stage (RLHF policy optimization)
The third training step, in which the SFT model is further fine-tuned with the Proximal Policy Optimization algorithm to maximize the scalar reward produced by the reward model.Reward model over-optimization (5 connections) §“3.5 Models”, p. 9
- Reward model over-optimization — demands a different mitigation than → Alignment tax
- Reward model over-optimization — surfaces as → Excessive hedging on simple questions
- Goodhart's law — is empirically instantiated by → Reward model over-optimization hindsight
- Reward model over-optimization — is preemptively countered by → Per-token KL penalty from the SFT model
- Pong (Atari game) — anticipates → Reward model over-optimization hindsight
The tendency of an RL policy to exploit imperfections in a learned reward model, producing outputs that score highly under the RM but are not actually preferred by humans.Likert overall-quality rating (1 connection) §“3.6 Evaluation”, p. 10
- Likert overall-quality rating — corroborates → Win rate (preference against baseline)
A 1-7 scale on which labelers rate the overall quality of a single model output, collected alongside pairwise rankings and metadata.RealToxicityPrompts (2 connections) §“3.6 Evaluation”, p. 10
- Perspective API — supplies the ground truth for → RealToxicityPrompts
- RealToxicityPrompts — diverges under respectful prompting from → Winogender
A benchmark dataset (Gehman et al., 2020) of sentence-start prompts with varying toxicity, used to evaluate a model's propensity to continue text toxically.Win rate (preference against baseline) (4 connections) §“3.6 Evaluation”, p. 10
- Elo Score (helpfulness/harmlessness) — generalizes → Win rate (preference against baseline) hindsight
- F1 score (span-overlap QA metric) — diverges under rlhf from → Win rate (preference against baseline)
- Inter-labeler agreement rate — caps the resolution of → Win rate (preference against baseline)
- Likert overall-quality rating — corroborates → Win rate (preference against baseline)
The primary human-evaluation metric: the fraction of times labelers prefer one model's output over that of a fixed baseline policy (the 175B SFT model) on matched prompts.Perspective API (1 connection) §“4.2 Results on public NLP datasets”, p. 13
- Perspective API — supplies the ground truth for → RealToxicityPrompts
A third-party automatic toxicity-scoring service used to obtain toxicity scores for model outputs on RealToxicityPrompts, cross-checked against human toxicity ratings.TruthfulQA (1 connection) §“4.2 Results on public NLP datasets”, p. 13
- Sycophancy — is tested via → TruthfulQA hindsight
A benchmark of short-answer questions (Lin et al., 2021) designed to test whether a model generates truthful and informative answers rather than mimicking common human falsehoods.CrowS-Pairs (1 connection) §“4.2 Results on public NLP datasets”, p. 14
- Entropy-based bias metric — strips the direction from → CrowS-Pairs
A benchmark dataset (Nangia et al., 2020) of paired sentences designed to measure social bias (stereotype vs. anti-stereotype) in language models.Winogender (2 connections) §“4.2 Results on public NLP datasets”, p. 14
- Entropy-based bias metric — recasts the task of → Winogender
- RealToxicityPrompts — diverges under respectful prompting from → Winogender
A benchmark dataset (Rudinger et al., 2018) of paired sentences used to probe gender bias in coreference-style completions, adapted here into a binary multiple-choice entropy evaluation.Generalized advantage estimation (GAE) (1 connection) §“C.4 Details of RLHF training”, p. 42
- Bandit environment formulation for RLHF — renders discounting moot in → Generalized advantage estimation (GAE)
The advantage-estimation technique of Schulman et al. (2016) used within PPO training, applied here with no discounting.- PPO value function §“C.4 Details of RLHF training”, p. 42The critic network used in PPO advantage estimation, initialized from the trained reward model's weights.
CNN/Daily Mail summarization (1 connection) §“D Automatic evaluation details”, p. 44
- CNN/Daily Mail summarization — duplicates the reported results of → Reddit TL;DR summarization
A news-summarization benchmark (Nallapati et al., 2016) using a 'TL;DR:' prompting format, included in the automatic evaluation suite.- QuAC (Question Answering in Context) §“D Automatic evaluation details”, p. 44A conversational question-answering benchmark (Choi et al., 2018) evaluated in the paper's automatic evaluation suite.
Reddit TL;DR summarization (2 connections) §“D Automatic evaluation details”, p. 44
- CNN/Daily Mail summarization — duplicates the reported results of → Reddit TL;DR summarization
- WMT 2015 French-to-English translation — bears the alignment tax that spares → Reddit TL;DR summarization
A summarization benchmark (Volske et al., 2017) of Reddit posts with author-written TL;DR summaries, included in the automatic evaluation suite.- RTE (Recognizing Textual Entailment) §“D Automatic evaluation details”, p. 44A binary textual-entailment benchmark, part of SuperGLUE, included in the automatic evaluation suite.
- SST (Stanford Sentiment Treebank) §“D Automatic evaluation details”, p. 44A binary sentiment-classification benchmark (Socher et al., 2013) included in the automatic public NLP evaluation suite.
SuperGLUE (2 connections) §“D Automatic evaluation details”, p. 44
- MMLU (Massive Multitask Language Understanding) — tests a different competence than → SuperGLUE hindsight
- WSC (Winograd Schema Challenge) — departs from the canonical format of → SuperGLUE
A benchmark suite (Wang et al., 2019) for general-purpose language understanding, from which the RTE and WSC tasks used in this paper are drawn.WSC (Winograd Schema Challenge) (1 connection) §“D Automatic evaluation details”, p. 44
- WSC (Winograd Schema Challenge) — departs from the canonical format of → SuperGLUE
A pronoun-coreference-resolution benchmark, part of SuperGLUE, included in the automatic evaluation suite.F1 score (span-overlap QA metric) (1 connection) §“DROP (Discrete Reasoning Over the Content of Paragraphs)”, p. 46
- F1 score (span-overlap QA metric) — diverges under rlhf from → Win rate (preference against baseline)
A token-overlap-based scoring metric used to evaluate model-generated answers against target completions on DROP, QuAC, and SQuAD v2.- BLEU §“WMT Fr En 15”, p. 49A standard machine-translation quality metric used to evaluate model outputs on the WMT 2015 French-to-English translation task.
- ROUGE-L §“CNN/DM Summarization”, p. 49A standard n-gram/longest-common-subsequence overlap metric used to score generated summaries against reference summaries on CNN/DM and Reddit TL;DR.