- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes reGROW, which optimizes agentic workflows through regular-expression edits while keeping module prompts, tools, and implementations fixed. A compiler checks candidate interfaces and execution bounds, while TabPFN predicts gains from historical edit outcomes to prioritize evaluations. Workflows before and after an edit are compared using the same tasks and random seeds. Finally, candidates are evaluated on an independent confirmation set, and the workflow with the lowest control exposure is selected from those satisfying quality-tolerance and cost constraints. Results across seven benchmarks are comparable to those of strong existing methods, and the ablations provide support for paired-gain prediction and composite edits.
Critical strengths
- With module interfaces fixed, routing, retries, and recovery have explicit execution rules. Field dependencies and call limits can be checked before any model invocation. This representation makes local edits easier to inspect and is useful for workflows with strict execution budgets.
- The reported results show that searching over workflows with fixed modules can still achieve competitive performance on reasoning, planning, and interactive tasks. Paired comparisons before and after edits are also appropriate, making the effects of individual modifications easier to assess.
Critical weaknesses
- MASS already reuses optimized module prompts during topology optimization, while MermaidFlow uses typed graph representations and constrained edits with candidate validation. reGROW goes further by fixing module implementations and using bounded control structures expressed through regular expressions. However, the two central ideas—separating module content from structure and checking candidates before execution—have clear precedents. Paired evaluation and TabPFN-based scheduling make the search procedure more complete, but I still view the overall method as an incremental extension of existing approaches. The additional research value of the regular-expression representation is not sufficiently clear.
- The default selection rule permits a preference for lower control exposure within a confirmation-score tolerance of 0.05. Control exposure sums the counts of processing actions, control decisions, and recovery sites with equal weights. I do not see why reducing this count warrants accepting a lower score. Actual execution cost is already measured separately, and the paper does not use the selected workflows to demonstrate concrete benefits from this preference. It remains unclear what useful guidance the criterion provides for choosing among verification, retry, and routing structures.
Questions for authors
- What practical benefit is reducing control exposure intended to provide? Could you use a final selection from an existing search run to illustrate how it differs from selecting by highest quality or lowest actual execution cost?
- In the ablations, does “keeping the candidate archive fixed” mean that each method starts from the same initial archive, or that all methods are compared using the same precollected archive? This distinction affects whether the results should be interpreted as evidence of search effectiveness or of the ability to select among existing candidates.