Search papers, labs, and topics across Lattice.
This paper introduces Naive Prompt Optimization (NPO), a streamlined method for prompt optimization that iteratively refines prompts using feedback from a teacher model, achieving performance on par with more complex optimizers like GEPA while requiring fewer rollouts. The findings indicate that leveraging stronger teacher models can effectively substitute for the intricate search processes typically employed in prompt optimization. Notably, NPO maintains competitive performance in interactive games and demonstrates transferable benefits across different student models, highlighting the efficacy of simpler approaches in prompt optimization.
Simple prompt optimization can outperform complex methods, revealing that less can be more in the quest for efficient AI performance.
Efficiently improving autonomous agents across diverse tasks is central to accelerating recursive self-improvement (RSI) in agentic AI, with prompt optimization emerging as a promising approach capable of delivering performance gains comparable to those achieved by fine-tuning model weights, while reducing computational costs in both optimization and serving. However, recent developments increasingly favor unnecessarily complex prompt optimizers. We introduce Naive Prompt Optimization (NPO), a lightweight single-lineage method that iteratively revises prompts using a teacher model with rollout feedback. NPO achieves comparable or better performance than GEPA with fewer rollouts, and its advantage increases with stronger teacher models, suggesting that stronger teacher reasoning can partially substitute for optimizer-side search complexity. In interactive games, NPO remains broadly competitive with GEPA, while GRPO performs better on some tasks less amenable to prompt optimization. We also show that NPO-optimized prompts elicit similar performance improvements when applied verbatim to other student models, especially across models within the same family. Overall, our preliminary results show that simple, linear prompt optimization can rival substantially more sophisticated and complex search procedures.
