NPO Matches GEPA With Fewer Rollouts
Naive Prompt Optimization (NPO) uses a teacher model, rollout traces, and rewards to iteratively revise a single prompt lineage. The paper reports comparable or better results than GEPA on IFBench and HotpotQA with slightly fewer rollouts, plus promising cross-model transfer.
NPO is a useful reminder that optimizer complexity can become a liability when stronger teacher reasoning and richer feedback already provide most of the signal.
- –Single-lineage revision removes candidate pools, branching search, and Pareto selection from the optimization loop
- –NPO’s advantage grows with stronger teachers, shifting complexity from search design toward model capability
- –Optimized prompts transfer best within the same model family, suggesting practical reuse across model sizes
- –Results remain preliminary, covering limited benchmarks and 22 interactive games rather than long-horizon agent workloads
- –Developers should treat NPO as a strong low-cost baseline before reaching for heavier prompt-search machinery
DISCOVERED
1d ago
2026-08-30
PUBLISHED
1d ago
2026-08-30
RELEVANCE
AUTHOR
omarsar0