AI
How a Simple Launch Check Became the Secret to Better Code Generation
A new study reveals that verifier precision—not complexity—drives gains in code self-distillation, with a judge-free strict-launch filter outperforming sophisticated reward models.
Researchers have uncovered a counterintuitive finding: the most effective way to improve code-generation models through self-distillation isn't a sophisticated learned judge, but something far simpler—a deterministic check that verifies whether generated code actually runs cleanly.
The Core Insight#
The study, published on arXiv, challenges conventional wisdom about post-training code models. While reward models trained to optimize certain metrics can sometimes push up scores without genuinely improving code quality, the researchers found that a straightforward, gate-free verification method works better. Their strict-launch gate—which simply tests whether code executes under a headless engine without errors—became the foundation for dramatic improvements.
Results That Speak for Themselves#
On the GameCraft-Bench dataset, a 14-billion-parameter model using rejection-sampling self-distillation with the strict-launch filter achieved remarkable gains:
- Clean-launch success rate on held-out code families jumped from 8.8% to 42.2%
- Coverage across 32 candidates improved from 84% to 100%—matching the performance ceiling of the gold reference implementations
- The model beat its supervised baseline on all 25 held-out tasks
Crucially, this approach required only one engine invocation per candidate—no reward model, no additional judge needed.
Verifier Precision Sets the Pace#
The key finding is that verifier precision directly governs the return on search effort. When researchers swapped the strict-launch check for a more lenient build verification, the gains vanished almost entirely (p=0.0012). Similarly, lowering semantic gate precision from perfect to partial-credit scoring created predictable, measurable costs: reducing precision by 75% cut gains proportionally, following a linear relationship with search fuel consumed.
Interestingly, only one direction of verifier error—false positives (accepting flawed code)—imposed real costs. Under count-matched conditions, false negatives (rejecting good code) had negligible impact.
Why This Matters#
The research demonstrates that in code self-distillation, the verifier functions as the curriculum: precise feedback defines which examples the model learns from and how effectively search effort translates into improvement. Quadrupling the number of candidates generated helped significantly only behind a strict gate, contributing +1.62 percentage points—but yielded essentially zero gains with a partial-credit gate. Recall, by contrast, proved nearly cost-free; search pays its way only through precise verification.

