Can small models match frontier reasoning without massive scale?
Explores whether verifiable reasoning ability emerges from training design rather than parameter count. Matters because it challenges the assumption that only very large models can solve hard math and code problems.
The reigning assumption is that frontier reasoning lives in tens-to-hundreds of billions of parameters: cross the scaling threshold or stay locked out of hard math and code. VibeThinker-3B is a direct counterexample. A dense 3B model, trained with the Spectrum-to-Signal post-training paradigm — curriculum-based SFT, multi-domain RL, then offline self-distillation — reaches 94.3 on AIME26 (97.1 with claim-level test-time scaling), 80.2 Pass@1 on LiveCodeBench v6, and 96.1% acceptance on unseen LeetCode contests, claiming parity with systems orders of magnitude larger. On verifiable tasks, the capability appears to be elicited by the pipeline rather than minted by raw scale.
What makes this credible rather than a benchmark stunt is the shape of the pipeline, which echoes results the vault already holds. Since Does sequencing imitation then exploration training improve reasoning?, the sequencing — imitation to lay a reasoning foundation, then RL to push against verifiers — is exactly VibeThinker's curriculum-SFT-then-multi-domain-RL structure, now shown to hold at 3B. And since When does RL actually extend reasoning beyond pretraining?, the curriculum is plausibly what keeps a small model perpetually at its edge of competence, where RL actually pays.
The load-bearing qualifier is verifiable. Every headline benchmark here has a checkable ground truth (a numeric answer, a passing test suite), which is precisely the regime where RLVR has a clean reward and small models can be driven hard. This is the boundary worth writing about: the result does not claim a 3B model matches flagships on open-ended judgment, long-context synthesis, or tasks without a verifier. The honest reading is that the cost of verifiable reasoning is collapsing toward the cost of a good pipeline — while the unverifiable frontier may still want scale.
The strongest counterargument is contamination and selection: heavy distillation and curriculum tuning on benchmark-adjacent data can inflate scores without transfer. The unseen-LeetCode generalization number is the rebuttal, but it is one signal, not proof of robustness off-distribution.
Inquiring lines that read this note 12
This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.
How can models identify insufficient information and respond appropriately without guessing? How effectively do deterministic tools improve language model reasoning on formal tasks?- What separates verifiable reasoning from open-ended judgment in scaling requirements?
- Why does formalizing the Kepler conjecture cost eleven years of work?
- Can benchmark scores on verifiable tasks transfer to unseen problems outside the training domain?
- How does requential coding measure true simplicity without parameter count inflation?
Related concepts in this collection 3
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
Does sequencing imitation then exploration training improve reasoning?
Can combining Supervised RL (expert imitation) followed by RLVR (outcome rewards) outperform either method alone on hard reasoning tasks? This explores whether curriculum ordering unlocks capabilities neither method achieves independently.
exemplifies: VibeThinker's pipeline is this imitation-then-exploration sequence instantiated at 3B
-
When does RL actually extend reasoning beyond pretraining?
Does reinforcement learning genuinely expand a model's reasoning capabilities, or does it merely improve sampling from existing knowledge? This question hinges on whether pretraining provides sufficient foundation and whether RL targets tasks within reach.
grounds: curriculum keeps the small model at its edge of competence where RL gains are real
-
Does gradually tightening token budgets beat fixed budget training?
Can models learn reasoning more efficiently by starting with generous token allowances and progressively constraining them, rather than training with fixed budgets from the start? This matters because it addresses how to teach models to think effectively while remaining concise.
convergent-with: curriculum design as the lever for small-model reasoning efficiency
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?
- RL Squeezes, SFT Expands: A Comparative Study of Reasoning LLMs
- VibeThinker-3B: Exploring the Frontier of Verifiable Reasoning in Small Language Models
- Local Coherence or Global Validity? Investigating RLVR Traces in Math Domains
- Reinforcing General Reasoning without Verifiers
- LLM-as-a-Verifier: A General-Purpose Verification Framework
- The Invisible Leash: Why RLVR May Not Escape Its Origin
- Escaping the Verifier: Learning to Reason via Demonstrations
Original note title
frontier reasoning is a property of the post-training pipeline not the parameter count — a 3B model reaches flagship verifiable-task scores via curriculum SFT plus multi-domain RL