Naive Prompt Optimization: Rethinking the Need for Complex Prompt Search

2026-08-27

AI Summary

本文提出了一种简单的单系迭代方法Naive Prompt Optimization来优化提示，通过减少计算成本同时保持或超越现有复杂优化器的性能，以促进AI代理在多任务中的效率提升。

Abstract

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.

Problem

• prompt optimization
• autonomous agents
• recursive self-improvement
• computational costs

Innovation

• Naive Prompt Optimization
• lightweight single-lineage method
• teacher model with rollout feedback
• performance gains
• computational costs