33 terms
Post-training glossary
Direct definitions of 33 post-training terms: RL environments, RLVR, RLHF, reward hacking, rubric rewards, verifiers, preference data, and inter-annotator agreement, with primary sources.
What is Agent trajectory?
An agent trajectory is the full recorded sequence of an agent’s observations, reasoning, tool calls, and environment responses while completing a task. Expert trajectories are used for supervised fine-tuning and as demonstrations, while model-generated trajectories with rewards are the raw material of RL updates.
- Related: Agent trajectory data
- Related: What makes an RL environment training-grade?
What is Cohen's kappa?
Cohen's kappa measures agreement between two raters on categorical labels, corrected for chance: κ = (pₒ − pₑ) / (1 − pₑ), where pₒ is observed agreement and pₑ is agreement expected by chance from each rater’s label frequencies. A value of 1 is perfect agreement and 0 is chance level.
- Source: Wikipedia: Cohen's kappa
- Related: Compare: expert vs crowd annotation
What is Confidence interval for eval accuracy?
A confidence interval for eval accuracy gives a range likely to contain a model’s true success rate. With n independent items and observed accuracy p, the normal approximation is p ± z·√(p(1−p)/n); the Wilson score interval behaves better near 0% or 100% or with small n.
What is Constitutional AI?
Constitutional AI is Anthropic’s method for training a harmless assistant using a written list of principles. The model critiques and revises its own outputs against the principles for supervised learning, then an AI model labels preferences according to them for RL, reducing the need for human harmlessness labels.
What is Crowdsourced annotation?
Crowdsourced annotation distributes labeling tasks to many non-specialist workers through a marketplace and aggregates their answers. Snow et al. showed that for several simple NLP tasks, a few aggregated non-expert labels could match expert quality, but the advantage shrinks when tasks require specialist knowledge.
- Source: Snow et al., EMNLP 2008
- Related: Compare: expert vs crowd annotation
What is Data contamination?
Data contamination occurs when evaluation items, or close paraphrases of them, appear in a model’s pretraining or post-training data, inflating benchmark scores without real capability gains. Environment builders mitigate it by deduplicating training tasks against public benchmarks and holding out freshly written evaluation tasks.
What is DPO (direct preference optimization)?
DPO trains a language model directly on preference pairs with a classification-style loss, skipping the separate reward model and RL loop used in RLHF. Rafailov et al. showed the optimal RLHF policy can be expressed in closed form, so preferences can be fit directly while keeping an implicit KL constraint.
- Source: Rafailov et al. (arXiv:2305.18290)
- Related: Compare: rlvr vs rlhf
What is Evaluation set?
An evaluation set is a held-out collection of tasks with reference answers or graders, used to measure model capability rather than to train it. Its size determines statistical precision: reported accuracy should carry a confidence interval, and small differences between models are often not significant on a few hundred items.
What is Expert annotation?
Expert annotation is labeling performed by people with verified domain credentials, such as physicians, lawyers, or PhD scientists, rather than general crowd workers. It costs more per label but is required where correctness depends on specialist knowledge, such as rubric writing for medical answers or grading graduate-level science.
- Related: Expert data at Anthroly
- Related: Compare: expert vs crowd annotation
What is Gold set?
A gold set is a collection of items with trusted reference labels, typically adjudicated by senior experts, used to measure annotator accuracy, calibrate model judges, and catch drift in labeling quality. Gold items are often mixed blindly into live annotation queues so performance is measured under normal working conditions.
- Related: Compare: expert vs crowd annotation
What is Goodhart's law?
Goodhart's law is the observation that when a measure becomes a target, it stops being a good measure. In post-training it explains why rewards, benchmarks, and rubric scores drift away from the qualities they were meant to track once a model is optimized directly against them, and why held-out evaluation remains necessary.
What is Grader?
A grader converts an episode into a reward value. It may be a deterministic program, a rubric scored by a model judge, or a human. Graders differ from verifiers mainly in scope: a grader can award partial credit or weight several criteria, whereas a verifier usually returns a binary correct or incorrect decision.
What is GRPO (group relative policy optimization)?
GRPO is a policy-gradient method that samples a group of responses per prompt and uses each response’s reward relative to the group mean as its advantage, removing the separate value network PPO requires. Introduced in DeepSeekMath, it became a common choice for RLVR training of reasoning models.
What is Inter-annotator agreement (IAA)?
Inter-annotator agreement measures how consistently independent annotators assign the same labels to the same items. Raw percent agreement overstates reliability because some agreement happens by chance, so chance-corrected statistics such as Cohen’s kappa, Fleiss’ kappa, or Krippendorff’s alpha are standard for reporting label quality.
- Related: Compare: expert vs crowd annotation
- Related: Eval sample size calculator
What is KL penalty?
A KL penalty adds the Kullback-Leibler divergence between the trained policy and a reference model to the RL objective, discouraging the policy from drifting far from its starting behavior. It limits reward hacking and preserves fluency, at the cost of slowing how much the policy can change per unit of reward.
What is Krippendorff's alpha?
Krippendorff's alpha is a chance-corrected reliability coefficient that works for any number of annotators, tolerates missing labels, and supports nominal, ordinal, interval, and ratio data. That flexibility makes it a common choice for annotation projects where not every item is labeled by every annotator.
- Source: Wikipedia: Krippendorff's alpha
- Related: Compare: expert vs crowd annotation
What is LLM-as-a-judge?
LLM-as-a-judge uses a strong language model to grade or compare other models’ outputs in place of human raters. Zheng et al. found GPT-4 judgments agreed with human preferences at rates comparable to human-human agreement, but also documented position, verbosity, and self-enhancement biases that must be controlled.
What is Outcome reward (ORM)?
An outcome reward scores only the final answer or end state of an episode, ignoring the intermediate steps. Outcome reward models are cheap to label and hard to argue with, but a correct final answer can follow flawed reasoning, and sparse outcome signals make credit assignment harder on long, multi-step tasks.
- Source: Uesato et al. (arXiv:2211.14275)
- Related: Compare: process vs outcome rewards
What is Pass-rate calibration?
Pass-rate calibration filters or reweights training tasks by how often the current model solves them, keeping tasks inside a learnable band rather than those solved every time or never. With group-relative advantages, tasks at 0% or 100% pass rate produce zero advantage and therefore no gradient.
What is pass@k?
pass@k is the probability that at least one of k sampled attempts solves a task, typically estimated from n ≥ k samples with an unbiased combinatorial estimator. In RL environment design, per-task pass rates identify tasks that are always or never solved, which give no learning signal under group-relative methods.
- Related: What makes an RL environment training-grade?
- Related: Eval sample size calculator
What is Preference data?
Preference data consists of a prompt with two or more candidate responses and a label saying which is better, sometimes with a strength or rationale. It trains reward models for RLHF and is consumed directly by methods such as DPO. Label quality depends heavily on annotator expertise and guidelines.
- Related: RLHF preference data
- Related: Compare: synthetic vs human preference data
What is Process reward (PRM)?
A process reward scores each intermediate step of a solution rather than only the final answer. Lightman et al. trained process reward models on PRM800K, roughly 800,000 human step-level labels, and found process supervision outperformed outcome supervision for selecting correct solutions on the MATH benchmark.
What is Reward hacking?
Reward hacking is when a policy finds behavior that scores highly under the specified reward without doing the intended task, such as editing tests so they pass or padding answers to satisfy a judge. It is a symptom of a gap between the measurable reward and the designer’s actual objective, and worsens with optimization pressure.
What is Reward model?
A reward model is a neural network, usually initialized from a language model, trained to output a scalar score predicting which response humans would prefer. It stands in for human judgment during RL. Because it is an imperfect proxy, optimizing hard against it can raise reward model scores while true quality falls.
What is Reward overoptimization?
Reward overoptimization is the measured pattern where optimizing a policy against a proxy reward model first improves true quality and then degrades it as optimization continues. Gao et al. characterized how this gap scales with reward model size and with how far the policy drifts from its initialization, measured by KL divergence.
What is RL environment?
A reinforcement learning environment is a packaged task setting that gives a model observations, accepts its actions, and returns a reward. For language models it usually bundles a prompt or task, tools or a sandbox the model can act in, and a grader that scores the final state or answer so training can update the policy.
What is RLAIF (RL from AI feedback)?
RLAIF replaces some or all human preference labels with judgments from another language model, which are then used to train a reward model or provide rewards directly. It cuts labeling cost and latency, but inherits the judging model’s biases, so teams typically audit a sample of AI labels against human or expert judgments.
What is RLHF (reinforcement learning from human feedback)?
RLHF fine-tunes a model with reinforcement learning against a reward model trained on human preference comparisons. Annotators rank or compare model outputs, a reward model learns to predict those preferences, and the policy is optimized to score highly, usually with a KL penalty that keeps it close to the starting model.
- Source: Ouyang et al. (arXiv:2203.02155)
- Related: Compare: rlvr vs rlhf
What is RLVR (reinforcement learning with verifiable rewards)?
RLVR trains a language model with rewards computed by a programmatic check instead of a learned reward model, for example exact-match math answers, unit tests passing, or constraint satisfaction. The term was popularized by the Tülu 3 report. It reduces reward-model exploitation but only works where correctness can be checked automatically.
What is Rubric-based reward?
A rubric-based reward scores a response against an explicit checklist of criteria, often written per prompt by domain experts, with a language model judge deciding whether each criterion is met. It extends RL beyond verifiable domains such as math into medicine or science, but rewards only what the rubric actually specifies.
What is Synthetic data?
Synthetic data for post-training is text generated by models rather than written by people, such as instructions bootstrapped by Self-Instruct or preference labels from AI judges. It scales cheaply but can reproduce the generator’s errors and blind spots, so it is usually filtered and spot-checked against human-written references.
What is Training-grade environment?
A training-grade environment is an RL environment fit to produce useful gradient signal, not just a score. It has tasks in a learnable difficulty band for the target model, graders with low false-positive and false-negative rates, reproducible execution, and no overlap with the evaluation sets used to report results.
What is Verifier?
A verifier is the component that decides whether a model’s output or final environment state is correct, for example a unit-test harness, a symbolic math checker, a regex, or a model-based judge. Its false-positive rate bounds how much a policy can exploit it, so verifiers need their own adversarial testing.