Batching the Reflective Optimization Loop: Parallel Proposals Make GEPA Faster and Better

Reflective text optimization makes agentic systems better, but the optimization loop is itself a resource-hungry workload whose sequential structure leaves parallel evaluation capacity idle.

By Zhang, Agrawal, Tan +6Oct 27, 2026

Score████░░░░░░4.0

Key numbers

68.9% to 72.1% on LiveBench-Math
49.0% to 60.0% on HoVer

Caveats

Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the original PDF Code

Abstract

Reflective text optimization makes agentic systems better, but the optimization loop is itself a resource-hungry workload whose sequential structure leaves parallel evaluation capacity idle. We extend the open-source GEPA optimizer to propose and evaluate a batch of candidates on each optimization step instead of one candidate at a time. In our sweep on two tasks, most batched runs finished in half the wall-clock time or less, and the fastest in about a quarter to a third. Batched settings also achieved higher held-out test scores, from 68.9% to 72.1% on LiveBench-Math (with 2×2) and from 49.0% to 60.0% on HoVer (with 8×1). A simple runtime model explains the measured speedups under a finite worker pool, and batched settings also spend their metric-call and dollar budgets more efficiently. We frame the axes along which a reflective optimization step can scale in parallel, a first look at allocating a fixed optimization budget across them.

Jialin Zhang, Lakshya A Agrawal, Shangyin Tan, Donghyun Lee, Lutfi Eren Erdogan, Dan Klein, Koushik Sen, Alex Dimakis, Matei Zaharia

The editor's rubric

Heuristic review

Leverage4 / 5: A general-purpose tool used across several fields (Adam, ResNet, LoRA, next-generation sequencing).; 24% of this desk’s rubric
Magnitude2 / 5: Solid incremental gain on a meaningful problem.; 18% of this desk’s rubric
Evidence3 / 5: Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.; 14% of this desk’s rubric
Novelty3 / 5: A genuinely new approach to an open problem.; 16% of this desk’s rubric
Trajectory3 / 5: A clear path to scale.; 18% of this desk’s rubric
Stakes2 / 5: Benefits a professional community (practitioners, clinicians, engineers).; 10% of this desk’s rubric

Dimension	Level	Weight	What that level means
Leverage	████░4/5	24%	A general-purpose tool used across several fields (Adam, ResNet, LoRA, next-generation sequencing).
Magnitude	██░░░2/5	18%	Solid incremental gain on a meaningful problem.
Evidence	███░░3/5	14%	Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
Novelty	███░░3/5	16%	A genuinely new approach to an open problem.
Trajectory	███░░3/5	18%	A clear path to scale.
Stakes	██░░░2/5	10%	Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (new method); breadth (many tasks); novelty (alternative to status quo); verification (multiple benchmarks, held-out test, code released); scale (scalable, efficient).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.0

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit: 5.9 / 10; Weighted rubric, evidence-gated.
Adjusted merit: 4.8 / 10; Shrunk toward the desk prior by editor confidence (44%).
Attention: 0%; Citations, upvotes, points, mentions.
Freshness: 82%; Half-life decay since publication.

No attention signals recorded yet.

The record

Reviewed by heuristic-v10 on Oct 28, 2026, 01:23 UTC. Paper type: method.
Categories: cs.AI, cs.CL, cs.LG
BRIEF, No.9 in the Artificial Intelligence edition of October 28, 2026.