Nathan Lambert
Corrections and questions from the GitHub, Discord, and YouTube comments through Lecture 11.
A viewer asks:
Hi Nathan, thanks for another great video on post-training! At @24:21, this got me thinking (and I might be misunderstanding): if each capability is sort of its own “mode,” would it make sense to post-train stage by stage — coding → math → agentic tool use → etc. — learning one mode at a time? My guess is this intuition is wrong somewhere, since it seems like people don’t really do this and still put a lot of care into the data mixture. Would love to understand what I’m missing here.
A viewer asks – should post-training be sequential rather than a strong mix.
In industry post-training has a shocking number of stages and sequencing. It is usually not just per-capability in a line, rather with forking & merging, with some sequence too.
The emerging version trains specialist teachers in parallel, then consolidates them into one student with multi-teacher on-policy distillation (MOPD). See Conversation 1 (w/ Finbarr Timbers).

Sources: MiMo-V2-Flash, MOPD

A fun paper! Integrated a bit into Nemotron, but not accepted as state-of-the-art.
Source: (NVIDIA, 2025)

Read: Nemotron-Cascade 2 on arXiv.
Source: (NVIDIA, 2026)
A follow-up from the Lecture 10 comments:
And on a related note, it seems like for RLVR the default is to drop the KL term entirely. My understanding is that this is because in RLVR the reward is verifiable ground truth, so we don’t run into the over-optimization problem you get in RLHF, where a learned reward model is only a proxy (and arguably a proxy of a proxy, since the preference data itself approximates what we actually care about). Is that the right way to think about it?
Overall yes. We even found during Tülu 3 that in RLVR the models are very good at selectively updating behaviors – e.g. learning math without OOD degradation.
From the Lecture 2 comments:
You mention some pocket rules for prompt budgets, e.g. ~1M prompts for SFT. In your experience, how does this number scale with the size of the model being post-trained?
Mostly, bigger models tend to need less data (e.g. Tülu 3 405B). They’re more sample efficient at RL (in terms of steps, not total GPU hours) and need less SFT data (or much of SFT data doesn’t help them). I’d read this as bigger models need fewer tokens/capability, which fits scaling laws.
This has confounders today, as midtraining and SFT are almost indistinguishable in some ways. They both seed the reasoning behaviors in the models.
Source: @secmt on YouTube (Lecture 2); budgets from (Lambert et al., 2024)
A great question from the Lecture 3 comments:
Hi Nathan. i have a question about some recent papers about RL vs. SFT for LLMs. So the conventional belief is that RL is good for hardcore reasoning tasks whereas SFT is good for getting the structure and formatting, which is basically why we had 2-3 phases in post-training for so long so we believe they do different things. But there are always new papers popping up saying RL is basically just SFT with some regularized term, and if you do their regularized version of SFT, you can get the same result and then they give you a bunch of plots and graphs in their paper demonstrating that to you. How believable/generalizable is this? I can’t imagine it generalizes to big models; otherwise, DeepSeek and GLM would already be doing it…
On the premise: I’d say it’s less “SFT for formatting, RL for reasoning” and more that SFT is the foundation (and very compute efficient these days), then RL is how the model learns a lot more from there — on harder problems, and adapting to the harnesses it’ll be used in at deployment.
Both are impossible to get around right now. Still, great models can be made with mostly SFT as the field moves so fast. Any good data work will get you far.
Yes — the two updates share their core term, and on curated targets SFT is the “all-positive” special case (same can be shown for DPO). That shared algebra is what drives iw-SFT (Qin & Springenberg, 2025), DFT (Wu et al., 2025), and the unified-view papers (Lv et al., 2025).
A huge difference: negative gradients. RL pushes below-baseline samples down — it learns from its own mistakes, which SFT structurally cannot do. + the power of on-policy learning to regularize and nudge a model.
For the math see Lecture 10.
From the Lecture 7 comments:
When should in-house traces be learned into the weights rather than handled with in-context learning?
Mostly it comes down to cost, how much inference you’re doing, and what the improvements are worth monetarily. Build evaluations to see where you’re at, but assume any meaningful training effort is at least millions or tens of millions.
Source: @Decocoa on YouTube (Lecture 7)
From the Lecture 7 comments.
Distillation data as a category doesn’t make it good or bad. It depends on the teacher model, the student model, the filtering, the generation procedure etc. I’m sure people have made both failed models and SOTA models with continued pretraining on synthetic data.
Questions, comments, and future Q&A prompts: