ESPO cuts prompt bloat in prompt optimization
arXiv 2609.04197's ESPO diagnoses error structures, diversifies candidates, and applies bootstrap stability selection. It hits 74.67% average accuracy, beating GEPA while using prompts 47% shorter.
Why prompts keep inflating
Evolutionary prompt optimization methods like GEPA repeatedly append rules and exceptions to the prompt. Even after three or more rounds, prompt length can grow 3x while accuracy barely improves. The authors identify three structural causes: incomplete error observation, limited search diversity, and unreliable selection. In each round, GEPA samples only 3–8 random errors, so systematic failure patterns get missed. It then mutates prompts with a single operator, which tends to stack redundant rules instead of fixing root causes. Finally, it picks survivors by point estimation on a small validation set, where noise can win out over true quality.
ESPO’s three-phase framework
ESPO stands for Error-Structured Prompt Optimization, and it recasts optimization as structured statistical estimation. Phase 1, Diagnose, collects all training errors under the current prompt and clusters them into 3–7 structural patterns in one round, so the optimizer gets complete error coverage instead of a sparse random snapshot. Phase 2, Propose, generates candidates through four complementary strategies: diagnostic revision, consolidation, ablation, and factual injection. Each strategy carries a different inductive bias, so the candidate pool explores distinct remedy types rather than one mutation profile. Phase 3, Select, applies bootstrap stability selection with B=20 resamples. The candidate that wins the most resamples wins, with ties broken in favor of shorter prompts.
Quantitative comparison with GEPA
The authors benchmark on Tweet, MMLU, GSM8K, HotpotQA, ScoNe, HoVer, and PUPA using a deliberately weak default prompt and Claude Sonnet 4.5 as the student model. ESPO averages 74.67% accuracy versus GEPA’s 70.91%, a +3.76 pp gain. At the same time, the average prompt length is 1,004 characters, 47% shorter than GEPA’s 1,878 characters. On HotpotQA, GEPA balloons to 2,845 characters while ESPO keeps 1,008 characters and preserves a usable accuracy edge. The shorter prompt also translates into lower inference latency.
Generalization across models
To test whether the optimization transfers, the authors rerun on Gemma 3 12B, Mistral 14B, Qwen3 32B, and Claude Haiku 4.5. ESPO achieves the best average accuracy on every tested model. The largest jump appears on Qwen3 GSM8K, where the default prompt scores 15.00% and ESPO climbs to 91.40%, a +56.00 pp improvement over GEPA. Across the four models, ESPO prompts are 30–60% shorter while tracking toward higher accuracy.
Why this structure matters
Length-only constrained GEPA lifts accuracy from 70.91% to 71.00%, essentially flat. Simply capping length does not guarantee accuracy gains because the underlying selection problem remains noisy. ESPO improves accuracy and compresses prompts simultaneously because its Diagnose phase targets the right patterns, Propose builds focused candidates, and Select stabilizes choice under validation noise. The three components move together.
Practical use and limitations
ESPO’s bootstrap selection is well suited to small validation sets, but the experiments rely on a single strong LLM—Claude Sonnet 4.5—for both reflection and selection, using a 70/30/500 split. That setup keeps the design tight, though external validation on other reflection models is still limited. The framework offers a practical route to shorter, more accurate prompts, but users should still evaluate optimized prompts on bias-relevant slices before deployment, especially for sensitive applications.
References
Related posts
AI/ML ResearchA Two-Stage Framework That Makes LLM Reasoning 5,000x Faster
arXiv 2609.05363 proposes a framework that distills LLM reasoning into 15.5M student models and specializes reasoning per category. It achieves 5,000x speed at 100K steps and AUC 0.941.
AI/ML Research리테일 검색 지역 편차, 그래디언트 충돌로 풀어낸 RegionFed
Walmart Global Tech가 arXiv 2609.05403으로 공개한 RegionFed는 리테일 검색의 지역별 데이터 편차를 gradient-level 신호로 풀어 연합학습이 트랜스포머에서 붕괴하는 문제를 해결한다. T5·RoBERTa·CNN에서 아키텍처 변경 없이 92.27% 정확도, ε≈0.60 차등정보보호를 달성한 점이 핵심 결과다.
동시 확률 게임 학습, 첫 PAC 프레임워크 제시
Angel Y. He와 David Parker는 일반합 동시 확률 게임에서 천이 불확실성을 다루는 최초의 PAC 학습 프레임워크를 제시했다. 데이터 기반 신뢰구간과 강건한 MDP 탐색 메커니즘을 결합해 근사 Nash 균형을 계산하거나 균형이 존재하지 않음을 사운드하게 인증한다. 샘플 복잡도는 이론 경계와 일치하는 수준으로 실증됐다.
Curated, fact-checked, and edited by a single operator before publishing.