EvoTool: Self-Evolving Tool-Use Policy Optimization in LLM Agents via Blame-Aware Mutation and Diversity-Aware Selection

Shuo Yang, Soyeon Caren Han, Xueqi Ma, Yan Li, Mohammad Reza Ghasemi Madani, Eduard Hovy

School of Computing and Information Systems, The University of Melbourne

ACL 2026

+5.7
Overall over the strongest baseline
GPT-4.1 backbone: 70.6 vs 64.9
+5.2
Overall over the strongest baseline
Qwen3-8B backbone: 57.0 vs 51.8
4 / 4
Best average score on all four benchmarks
ToolBench · RestBench · τ-Bench · BFCL — with both backbones

Abstract

LLM-based agents depend on effective tool-use policies to solve complex tasks, yet optimizing these policies remains challenging due to delayed supervision and the difficulty of credit assignment in long-horizon trajectories. Existing approaches tend to be either monolithic, which are prone to entangling behaviors, or single-aspect, which ignore cross-module error propagation. To address these limitations, we propose EvoTool, a self-evolving framework that optimizes a modular tool-use policy via a gradient-free evolutionary paradigm. EvoTool decomposes agent’s tool-use policy into four modules, including Planner, Selector, Caller, and Synthesizer, and iteratively improves them in a self-improving loop through three mechanisms. Trajectory-Grounded Blame Attribution uses diagnostic traces to localize failures to a specific module. Feedback-Guided Targeted Mutation then edits only that module via natural-language critique. Diversity-Aware Population Selection preserves complementary candidates to ensure solution diversity. Across four benchmarks, EvoTool outperforms strong baselines by over 5 points on both GPT-4.1 and Qwen3-8B, while achieving superior efficiency and transferability.

Learning Curve & Efficiency

Panel (a): learning curves of average score versus evolution iteration on ToolBench, RestBench, tau-Bench, and BFCL — EvoTool climbs above DRAFT, EvoPrompt, OPRO, AdaPlanner, and the static ReAct line on all four. Panel (b): success rate versus log total token cost under GPT-4.1 on the same four benchmarks — EvoTool occupies the upper-left (higher performance at lower cost) relative to DRAFT, EvoPrompt, OPRO, AdaPlanner, and ReAct.
Figure 3: Learning dynamics and efficiency comparison. (a) Learning curves across evolution iterations on four benchmarks. (b) Performance versus log token cost under GPT-4.1.
Illustrative genealogy tree of EvoTool's evolutionary search: from a seed population, coloured edges mark which module each accepted mutation edited; grey boxes are gate-rejected children, red dashed boxes are candidates discarded by diversity selection, green boxes survive in the final population, and the highlighted path ends at the gold returned policy.
Search process: An illustrative genealogy of the evolutionary search behind these curves (scores are illustrative). Each generation samples one parent (∝ win frequency) and mutates exactly one module (edge colour); the gate keeps a child only if it beats its parent (grey = gate-rejected), and diversity-aware selection drops population members that win no held-out instance (red). Green candidates survive in the final population; the highlighted lineage ends at the returned policy (gold).

Method

EvoTool architecture: (1) trajectory collection — the modular tool-use policy agent (Planner, Selector, Caller, Synthesizer) interacts with the tool environment and records an episode; (2) the Blamer LLM performs trajectory-grounded blame attribution over the four modules; (3) the Mutator LLM applies feedback-guided targeted mutation to the blamed module; (4) diversity-aware population selection updates probabilities, identifies instance-wise winners, and retains complementary candidates in the population pool.
Figure 2: Overall architecture of EvoTool. EvoTool optimizes a modular tool-use policy through a self-evolving loop consisting of (1) trajectory collection from the tool environment, (2) trajectory-grounded blame attribution to identify the responsible module, (3) feedback-guided targeted mutation to update that module using natural language feedback, and (4) diversity-aware population selection over candidate policies to retain complementary candidates.
1

Trajectory-Grounded Blame Attribution

Supervision in long-horizon tool use is delayed, making credit assignment hard. EvoTool uses diagnostic traces from the rollout to localize each failure to a specific module — Planner, Selector, Caller, or Synthesizer — turning a trajectory-level outcome into a module-level signal.

2

Feedback-Guided Targeted Mutation

Given the blamed module, a mutator edits only that module’s prompt specification, guided by a natural-language critique of the failure. Edits stay targeted, avoiding the entangled behaviors that monolithic rewrites are prone to.

3

Diversity-Aware Population Selection

Rather than greedily keeping a single best candidate, the population preserves complementary candidates to ensure solution diversity, so distinct strengths survive across generations of the self-improving loop.

Gradient-free by design: only the four module prompt specifications evolve — the LLM weights stay frozen.

Case Study & Interactive Replay

Reference testbed run — Qwen3-4B backbone on curated 150-instance demo subsets
Learning curve of a reference EvoTool testbed run: held-out score rising over generations as targeted mutations are accepted.

The curve shows EvoTool’s loop at work on a small controllable testbed: blame attribution localizes each failure to one module, targeted mutations accumulate module-by-module fixes, and the held-out score rises in steps as stronger policies take over. In the interactive replay you can step through every generation — which module was blamed, the exact prompt edit, and whether the child was accepted.

Main Results

EvoTool is evaluated on four tool-use benchmarks — ToolBench, RestBench, τ-Bench, and BFCL — against prompting, prompt-evolution, and tool-use-specific baselines, with two backbones.

GPT-4.1 backbone
MethodToolBench AvgRestBench Avgτ-Bench AvgBFCL AvgOverall
ReAct63.673.447.956.060.6
CoT50.961.729.832.344.5
Plan-and-Solve59.367.047.641.354.4
OPRO65.275.147.558.962.1
PromptBreeder63.274.743.958.860.5
EvoPrompt66.476.948.662.163.8
AdaPlanner56.568.250.555.257.5
EasyTool73.982.540.656.164.4
DRAFT75.884.838.854.964.9
AnyTool67.776.848.358.263.3
EvoTool (ours)77.786.252.063.170.6
Qwen3-8B backbone
MethodToolBench AvgRestBench Avgτ-Bench AvgBFCL AvgOverall
ReAct54.263.523.852.049.0
CoT43.353.311.431.135.7
Plan-and-Solve50.457.923.539.843.7
OPRO55.564.923.554.450.2
PromptBreeder53.964.621.054.249.0
EvoPrompt56.566.524.355.851.4
AdaPlanner48.159.025.651.646.3
EasyTool62.369.815.651.051.1
DRAFT64.573.313.449.851.8
AnyTool57.766.419.151.149.6
EvoTool (ours)66.274.625.856.757.0

Benchmark-level averages; per-subset numbers (ToolBench G1/G2/G3, RestBench TMDB/Spotify, τ-Bench Retail/Airline, BFCL Single/Multi) are reported in the paper. Metrics — ToolBench: Pass Rate · RestBench: Success Rate · τ-Bench: Pass@1 · BFCL: Accuracy.

Ablations

Where to mutate: blame attribution (Qwen3-8B)
VariantToolBenchRestBenchτ-BenchBFCLAvg
Static (no evolution)55.965.521.052.048.6
Random module45.852.715.943.639.5
Planner-only51.258.624.750.146.2
Selector-only63.170.820.448.250.6
Caller-only57.466.320.255.649.9
Synthesizer-only55.065.121.250.748.0
Monolithic59.667.220.648.849.1
EvoTool (blame-aware)66.274.625.856.757.0

Blame-aware targeting beats random, single-module, and monolithic mutation.

What guides the mutation (Success Rate; benchmark context in the paper)
VariantTrajectory τFeedback FSuccess RateΔ
EvoTool (full)74.6
w/o τ70.2−4.4
w/o F65.2−9.4
w/o τ & F62.8−11.8

Both the trajectory τ and the feedback F matter: removing them costs −4.4 / −9.4 / −11.8 points.

How to select survivors (Qwen3-8B)
VariantToolBenchRestBenchτ-BenchBFCLAvg
Static (no evolution)56.065.521.052.048.6
Greedy61.169.023.654.352.0
Top-k62.771.422.154.652.7
EvoTool (diversity)66.274.625.856.757.0

Diversity-aware selection > top-k > greedy > static.

Blame-driven error progression

Why does blame-aware targeting win? Decomposing errors by module over iterations shows targeted mutation fixing the most correctable failures first: on ToolBench the total error rate falls from 77.6% to 20.2%, driven early by Caller/Selector fixes, while on τ-Bench the residual errors stay Planner-heavy, reflecting its long-horizon demands.

Stacked bar charts of module-level error rates (Caller, Selector, Synthesizer, Planner) with a total-error line over eight evolution iterations: (a) ToolBench, total error falling from 77.6% to 20.2%; (b) tau-Bench, total error falling from 87.6% to 33.3%.
Module-level error progression across evolution iterations diagnosed by the Blamer LLM.

Efficiency & Transferability

Superior efficiency

EvoTool achieves its gains with superior efficiency: comparing methods by performance versus (log) token cost — Figure 3(b) above — EvoTool sits on the favorable side of that trade-off. See the paper for the full analysis.

Two transfer matrices with zero-shot reference rows: (a) dataset transferability between ToolBench and RestBench under GPT-4.1, with in-domain and transfer cells all above the reference; (b) model transferability between Qwen3-8B and GPT-4.1, with transfer gains of +4.7 and +12.7 over the reference.
Transferability across datasets and backbone models. (a) Cross-dataset transfer between ToolBench and RestBench. (b) Cross-model transfer between Qwen3-8B and GPT-4.1.

Evolved policies transfer

Across datasets (GPT-4.1): a policy evolved on ToolBench transfers strongly to RestBench, and the same pattern holds in the reverse direction.

Across models: a Qwen3-8B-evolved policy remains effective on GPT-4.1, beating the baseline by 4.7 points, while a GPT-4.1-evolved policy transfers back to Qwen3-8B by a significant 12.7 points.

BibTeX

@inproceedings{yang-etal-2026-evotool,
    title = "{EVOTOOL}: Self-Evolving Tool-Use Policy Optimization in {LLM} Agents via Blame-Aware Mutation and Diversity-Aware Selection",
    author = "Yang, Shuo  and
      Han, Caren  and
      Ma, Xueqi  and
      Li, Yan  and
      Ghasemi Madani, Mohammad Reza  and
      Hovy, Eduard",
    editor = "Liakata, Maria  and
      Moreira, Viviane P.  and
      Zhang, Jiajun  and
      Jurgens, David",
    booktitle = "Proceedings of the 64th Annual Meeting of the {A}ssociation for {C}omputational {L}inguistics (Volume 1: Long Papers)",
    month = jul,
    year = "2026",
    address = "San Diego, California, United States",
    publisher = "Association for Computational Linguistics",
    url = "https://aclanthology.org/2026.acl-long.2016/",
    doi = "10.18653/v1/2026.acl-long.2016",
    pages = "43553--43572",
    ISBN = "979-8-89176-390-6"
}