NPO paper: prompt optimization may hinge on teacher feedback, not search trees
rohanpaul_ai · x · 2026-09-02
- A paper compares NPO with GEPA for prompt optimization: GEPA maintains multiple prompt candidates with Pareto-based selection, while NPO keeps a single prompt lineage and asks a teacher model to revise it using recent rollout traces and rewards.
- Result: NPO matches or beats GEPA, suggesting prompt optimization may not need an elaborate search tree at all—the quality of the teacher and its feedback matters more.
- Counterintuitive takeaway for prompt engineers: invest in the revision feedback loop rather than complex search structures.
More from Research
- Until Labs scales cryoprotectant discovery to 250,000+ candidate molecules with AI — lukaszkaiser · 2026-09-03
- Stanford's Michael Bernstein builds a "What-If Machine" for simulating decisions with AI — msbernst · 2026-09-03
- ByteDance Research Suggests Looped Transformers Now Match Deep Models on Compute Efficiency — georgejrjrjr · 2026-09-03
- Schmidhuber points to his 2015 paper as the origin of recurrent depth and chain-of-thought — SchmidhuberAI · 2026-09-03
- Matthew Yang starts PhD at MIT CSAIL advised by LlamaIndex's Jerry Liu — lateinteraction · 2026-09-03
- University press release headline vs. what the paper actually shows — EricTopol · 2026-09-03