New paper: SFT can generalize as well as RL given enough diverse data
josh_wills · x · 2026-11-18
Since DeepSeek-R1, "RL generalizes, SFT memorizes" has been treated as gospel, with plateaued SFT runs blamed on the algorithm. A new paper argues the comparison was unfair: RL gets a huge rollout budget per prompt while SFT trains on a tiny data slice. Testing on Qwen2.5 and Qwen3, the authors show that mixing data sources instead of distilling from one giant teacher and scaling up data lets SFT generalize just as well as RL. Practitioners conclude the mid-training/SFT boundary is increasingly meaningless — high-quality, diverse data is always the best bet.
Related event: New Paper Challenges "RL Generalizes, SFT Memorizes" Consensus(2 posts)→
More from Research
- Lean community certifies Riemann proof; honeypot fake keys expose breaches at three AI providers — LeviTurk · 2026-11-22
- Riemann hypothesis 'proven by Turkish mathematician using AI' claim mocked as the 'Organic Turk' — CatAstro_Piyush · 2026-11-22
- Andriy Burkov releases The Hundred-Page Language Models Book, hands-on with PyTorch — burkov · 2026-11-22
- Generative AI meets cardiology: Dagstuhl seminar bridges ML and clinical practice — StephanMandt · 2026-11-22
- SubRoformer hits SOTA music source separation with DSP subband filters — affige_yang · 2026-11-22
- Emily Riehl releases Lean game teaching dependent type theory at intro-to-proofs level — abhi9u · 2026-11-22