Reflection in the Dark: Exposing and Escaping the Black Box in Reflective Prompt Optimization
Not on the map. Why?
Abstract (arXiv)
Automatic prompt optimization (APO) has emerged as a powerful paradigm for improving LLM performance without manual prompt engineering. Reflective APO methods such as GEPA iteratively refine prompts by diagnosing failure cases, but the optimization process remains black-box and label-free, leading to uninterpretable trajectories and systematic failure. We identify and empirically demonstrate four limitations: on GSM8K with a defective seed, GEPA degrades accuracy from 23.81% to 13.50%. We propose VISTA, a multi-agent APO framework that decouples hypothesis generation from prompt rewriting, enabling semantically labeled hypotheses, parallel minibatch verification, and interpretable optimization trace. A two-layer explore-exploit mechanism combining random restart and epsilon-greedy sampling further escapes local optima. VISTA recovers accuracy to 87.57% on the same defective seed and consistently outperforms baselines across all conditions on GSM8K and AIME2025.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 19 of its 32 references that are in the map. First posted on arXiv 19 Mar 2026.
Builds on
19 of 32 references.
References · 19
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2022Large Language Models are Zero-Shot Reasonerscited by 4,323
- 2023Self-Refine: Iterative Refinement with Self-Feedbackcited by 3,317
- 2023AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversationcited by 1,906
- 2021Calibrate Before Use: Improving Few-Shot Performance of Language Modelscited by 1,371
- 2021Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivitycited by 1,122
- 2022Large Language Models Are Human-Level Prompt Engineerscited by 1,020
- 2023Large Language Models Cannot Self-Correct Reasoning Yetcited by 965
- 2023Automatic Prompt Optimization with "Gradient Descent" and Beam Searchcited by 628
- 2023Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolutioncited by 521
- 2025MathArena: Evaluating LLMs on Uncontaminated Math Competitionscited by 275
7 more
- 2024Optimizing Instructions and Demonstrations for Multi-Stage Language Model Programscited by 270
- 2024When Can LLMs Actually Correct Their Own Mistakes? A Critical Survey of Self-Correction of LLMscited by 230
- 2023Is Self-Repair a Silver Bullet for Code Generation?cited by 191
- 2022Instruction Induction: From Few Examples to Natural Language Task Descriptionscited by 152
- 2023GPT-4 Doesn't Know It's Wrong: An Analysis of Iterative Prompting for Reasoning Problemscited by 88
- 2026EvoX: Meta-Evolution for Automated Discoverycited by 45
- 2023EvoX: A Distributed GPU-accelerated Framework for Scalable Evolutionary Computationcited by 16
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026SPEAR: Code-Augmented Agentic Prompt Optimizationcited by 0
- 2026Adaptive-GEPA: Make Your Harness Fit Heterogeneous Requestscited by 0
- 2026Adaptive-GEPA: Make Your Harness Fit Heterogeneous Requests30 Sep 2026
- 2026SPEAR: Code-Augmented Agentic Prompt Optimization25 May 2026