$ attention.sh

knowledge base · entry 18

The recipe, published — every stage, every dataset

A read-through of Tulu 3: Pushing Frontiers in Open Language Model Post-Training — the capstone of this arc. Entries 1417 gave you the pieces: curated data, the three-step template, the cheap preference loss, the one-GPU hardware. Tulu 3 is what happens when a lab runs the whole pipeline end to end and publishes everything — data, mixes, hyperparameters, code, and the evals — until the open recipe beats the closed products.

paper Tulu 3: Pushing Frontiers in Open Language Model Post-Training
authors Lambert, Morrison, Pyatkin, Huang, Ivison, Brahman, et al. — Allen Institute for AI & University of Washington
source arXiv:2411.15124
why we read it it is the most honest public account of how modern post-training is actually done — the document that turns entries 14–17 from four papers into one runnable pipeline, and proof that none of the recipe is secret

every figure zooms — click it, scroll to magnify, drag to pan

part one

Why this paper exists

figure 1 · the transparency gap

The recipe everyone used and nobody published

By 2024, every strong model was post-trained hard — and the labs said almost nothing about how. Open models shipped weights but not the data or the decisions; the actual craft — what to mix, in what order, with which checks — was folklore. Tulu 3’s stated purpose is to close that gap: a family of models at the open frontier, with the training data, recipes, code, infrastructure, and evaluation suite all released.

click any figure to zoom · scroll to magnify · drag to pan

part two · the pipeline

Four stages, and where each entry plugs in

figure 2 · the assembly line

Curate → SFT → DPO → RLVR

The pipeline is the arc in one diagram. Stage 0: skill-targeted data curation with aggressive decontamination (entry 14’s discipline, industrialized). Stage 1: supervised fine-tuning on the curated mixture (entry 15’s step one). Stage 2: preference tuning — but with length-normalized DPO, not PPO (entry 16’s shortcut, hardened). Stage 3: the new move — reinforcement learning with verifiable rewards on tasks a program can grade.

Each stage starts from the previous stage’s checkpoint, and each is evaluated before the next begins. Nothing advances on vibes — the eval suite is fixed up front, with an unseen split held back to catch overfitting to the development benchmarks.

figure 3 · the data engine

Prompts by the skill, not by the pile

The data work is organized backwards from target skills — knowledge, reasoning, math, coding, instruction following, safety — rather than forwards from whatever corpora were lying around. Real conversations (WildChat, OpenAssistant) are mixed with persona-driven synthetic prompts: hundreds of thousands of generated instructions, each written “as” a different persona to force diversity — the Self-Instruct idea grown up. Every source is then decontaminated against the entire evaluation suite before training.

the quiet centerpiece decontamination gets its own released tooling. If eval prompts leak into training data, every number downstream is fiction — the paper treats this as an engineering discipline, not a footnote, and so should any team that fine-tunes.

figure 4 · the preference stage

DPO at industrial scale — with one fix

The preference stage is DPO, chosen over PPO-based RLHF after ablation — cheaper, stabler, and as good. Two upgrades matter. The pairs are substantially on-policy: the SFT model’s own completions are compared against other models’ outputs, so the training signal criticizes the very model being tuned. And the loss is length-normalized — dividing the log-ratios by response length — because vanilla DPO quietly learns that longer answers win, the verbosity bias every judge-trained system inherits.

figure 5 · RLVR

When the grader is a program, skip the reward model

The final stage is the bridge to entry 12. For skills where correctness is checkable — grade-school math (GSM8K), competition math (MATH), precise instruction following (IFEval) — you do not need a learned reward model at all. Generate an answer, run the checker, reward only verified correctness, and optimize. No reward-model blind spots to strip-mine, no judge to sweet-talk: the model is paid only when it is actually right.

Weeks after this report, DeepSeek-R1 showed the same verifiable-reward idea, pushed with enough scale and patience, produces emergent chain-of-thought reasoning. Tulu 3 is the modest, reproducible version of the bet R1 made famous.

figure 6 · worked by hand

The data budget, stage by stage

The shape of the spending repays attention: roughly a million carefully mixed prompts at SFT, a few hundred thousand preference pairs at DPO, and tens of thousands of verifiable prompts at RLVR — a pyramid that narrows exactly as the signal per example gets richer. Note what it echoes: imitation is the bulk, preference is the refinement, verified reward is the final polish.

part three · the verdict

The open recipe, scored

results · the scoreboard

Past the instruct models it started from

Both Tulu 3 models start from Llama 3.1 base — the same base Meta’s own instruct models use. On the averaged evaluation suite, the open recipe finishes ahead of Llama 3.1 Instruct, Qwen 2.5 Instruct and Mistral’s instruct models at matched size — and at 70B, ahead of the closed GPT-4o-mini and Claude 3.5 Haiku. The recipe, not the base, is the difference.

modelpost-trainingon the Tulu 3 suite
Tulu 3 70Bopen: SFT + len-norm DPO + RLVR, all publishedahead of every peer below
Llama 3.1 70B Instructclosed recipe, same base modelbehind
Qwen 2.5 72B Instructclosed recipebehind
GPT-4o-mini · Claude 3.5 Haikuproprietary, API-onlybehind at 70B scale

An 8B variant shows the same pattern at small scale, and the released artifacts — the SFT mixture, the preference mixtures, the RLVR sets, the decontamination tools, the eval harness — mean the claim is checkable, which is the entire point.

the math · in the paper's notation

The two losses the recipe hardens

Tulu 3 invents little math; it selects and repairs. The two equations worth holding are its length-normalized DPO and the RLVR objective — both small edits of formulas from entries 15–16, decoded here.

the equations · worked

Normalize the length, verify the reward

§6 · length-normalized DPO

ℒ = −log σ( β|yw|·log πθ(yw|x)πref(yw|x)β|yl|·log πθ(yl|x)πref(yl|x) )

read aloud: entry 16's DPO loss, with each answer's log-ratio divided by that answer's length. A sequence's log-probability is a sum over its tokens, so longer answers mechanically carry bigger numbers — vanilla DPO quietly learns "longer wins". Dividing by |y| makes the margin per-token, and the verbosity bias loses its lever.

  • |y|the answer's length in tokens — the term doing the de-biasing
  • βthe same leash strength as always
plug in → chosen: 100 tokens, total log-ratio +8; rejected: 400 tokens, total log-ratio +20. raw DPO margin: β(8 − 20) < 0 — the verbose answer wins. per-token: β(8/100 − 20/400) = β(0.08 − 0.05) > 0 — the denser answer wins. same pair, opposite lesson.

§7 · RLVR — the reward with no reward model

maxπθ Ey ~ πθ [ R(x, y) ] − β·DKL( πθ ‖ πref ),     R(x, y) = α · 𝟙[ verifier(x, y) passes ]

read aloud: the same leashed RL objective as InstructGPT's equation (2) — but the learned reward model rθ is replaced by an indicator: a program either verifies the answer or it doesn't. The reward is a constant times a check. Nothing to sweet-talk, nothing to strip-mine — the failure mode the KL leash existed to contain is largely amputated at the source.

  • verifiera program: does the math answer match, does the output obey the instruction's constraints
  • 𝟙[·]the indicator — 1 if the check passes, else 0
  • αthe reward's size — 10 in the paper; a scale, not a judgment
plug in → this is the equation DeepSeek-R1 (entry 12) runs at scale with GRPO — same indicator reward, more patience. one formula, two entries, and the bridge between the post-training arc and the frontiers arc.

part four

What we take from it

applied · our reading

The arc, folded into a checklist

where the arc goes next the frontier keeps moving — reasoning-first RL (entry 12), distillation from reasoning models back into small ones (entry 06’s revenge), and the open frontier models’ own tech reports. The recipe is public now; the craft is in the running of it.

source

Nathan Lambert, Jacob Morrison, Valentina Pyatkin, Shengyi Huang, Hamish Ivison, Faeze Brahman, et al. Tulu 3: Pushing Frontiers in Open Language Model Post-Training. arXiv:2411.15124. Figures on this page are our own; the pipeline, data organization, length-normalized DPO choice, RLVR design and comparative standings are the report’s, and plotted magnitudes are illustrative where not stated.

← back to the knowledge base  ·  ← entry 17 · QLoRA  ·  ↩ entry 14 · LIMA  ·  entry 12 · DeepSeek-R1 →

attention.sh — a division of Jinacode Systems. Transformers, fine-tuning, and sovereign LLMs.
we're hiring the curious — hello@attention.sh