EN KO
← All Publications

Rethinking the Role of Tool Graph Memory in Multi-Turn Tool Use

arXiv 2026
Uiji Hwang, Richeng Xuan, Taeuk Kim

One-Line Summary

A systematic re-examination of tool graph memory (ToolNet, H-EPM) across nine open-weight models and two multi-turn tool-use benchmarks shows that it rarely improves significantly over a memory-free agent, that its occasional gains cost 2.72× the LLM calls and arise from extra tool-calling attempts rather than the memory's (often incorrect) next-tool suggestions, and that storing the same experience as natural-language insight memory performs best in most settings with almost no additional LLM calls (1.03×).

Comparison of tool graph memory and insight memory on a holiday-date scenario
Figure 1. An example of tool graph memory and insight memory. The tool graph never suggests the prerequisite search_holiday, so the agent repeats timestamp_diff with an assumed date until the turn limit (58 LLM calls). Following the insight, the agent retrieves the holiday date first and succeeds in 4 LLM calls.

Background & Motivation

LLM agents increasingly solve complex tasks by calling external tools over multiple turns, and memory lets them retain and reuse experience from previous interactions. One prominent design is tool graph memory: successful trajectories are turned into a graph whose nodes are tools and whose weighted, directed edges are tool transitions. ToolNet shows the agent only the successors of the previously invoked tool, using edge weights as preference scores. H-EPM keeps the full tool set and treats the weighted transitions as procedural memory and the edge-attached context summaries as episodic memory; at each step the agent may summarize its state and then receives the two successor tools whose stored contexts best match that summary (or the two highest-weight successors otherwise).

Both methods provide step-level next-tool suggestions. Whether such guidance consistently helps agents across multi-turn interactions, however, had not been established with repeated runs, paired significance tests, or accounting of the extra computation it incurs.

Key questions: (1) Does tool graph memory consistently improve over memory-free baselines across model families, sizes, and benchmarks? (2) How much additional computation does it cost in LLM calls and tokens? (3) Where gains do exist, do they really come from the memory's suggestions? (4) Which failure modes remain even when the suggested tool is always correct, and what form of guidance would resolve them?

The answers turn out to be surprising: the gains are rare, expensive, and largely attributable to the agent simply attempting more tool calls, while even oracle-correct suggestions leave many failures untouched. This motivates rethinking memory as a soft prior about what to do in a situation rather than a prescription of the next tool.

Analysis & Proposed Method

The paper proceeds in four stages, moving from a broad empirical audit of tool graph memory to a lightweight alternative, insight memory, built from the very same experience.

1
Large-Scale Evaluation with Significance Testing
Agents with ToolNet or H-EPM are compared against a memory-free agent (Base) on ToolSandbox (207 test scenarios) and the multi-turn subset of BFCL-v4 (160 tasks), using nine open-weight models from the Qwen, Gemma, Mistral, and gpt-oss families (2B to 120B parameters) plus GPT-4.1 and GPT-5.1 on ToolSandbox. Every method is run three times with greedy decoding, and gains are checked with two-sided paired t-tests over scenarios. Cost is measured in LLM calls and tokens per scenario.
2
Manual Analysis of Decisive Turns
On Mistral-Small-3.2-24B, every scenario that fails under Base but succeeds with H-EPM is inspected by hand. Each decisive turn (the turn that accounts for the outcome difference) is annotated for whether the suggestion was correct and whether the agent followed it. The same annotation is applied to scenarios that H-EPM degrades, revealing that 98% of suggestions at those decisive turns are incorrect.
3
Controlled Ablations of the Suggestions
Keeping the rest of H-EPM fixed, the suggested tools are (a) replaced with random tools, (b) replaced with the correct tool as an oracle upper bound, or (c) removed entirely; the summarization step is also ablated. As a graph-free control, Base receives a single instruction: “Do not give a final answer or give up until you have tried the available tools” (Base + instruction). Tool calls are counted separately for scenarios each condition flips to success versus those that still fail.
4
Failure-Mode Taxonomy under the Oracle
Remaining oracle failures are classified by the earliest wrong decision: call necessity (whether to call a tool at all), tool selection (which tool), dependency (when to call it, i.e., prerequisites), and argument (with what values). With the correct next tool always suggested, tool selection errors almost vanish (4% of failures), so the remaining failures concern what to do in a situation, which a graph of tool transitions cannot encode.
5
Insight Memory
H-EPM's episodic summaries, including those of failed trajectories, are embedded with all-MiniLM-L6-v2 and clustered with k-means (k chosen from 15 candidates between 5 and 150 by silhouette score). The agent model distills each cluster into insights about what to do and what to avoid. At every model call, the five most recent messages are embedded, matched against all summaries, and the insights of the clusters of the two most similar summaries are added to the system prompt. No training is required, retrieval needs no LLM call (median 15–17 ms per turn), and the graph itself is never used.

Experimental Results

Task Performance (mean of three runs; + / − = significant gain / loss vs. Base)

ModelTS BaseTS ToolNetTS H-EPMTS InsightBFCL BaseBFCL ToolNetBFCL H-EPMBFCL Insight
Qwen3.5-2B0.4200.4280.4360.488+0.1330.044−0.1380.165
Qwen3-8B0.5000.5070.4760.556+0.1710.1290.1790.242+
Qwen3.6-35B-A3B0.6260.6080.6700.6740.1810.108−0.1560.206
gemma-4-E4B-it0.5880.547−0.5540.6200.2210.094−0.2520.285+
gemma-4-26B-A4B-it0.6900.655−0.7050.7050.5660.369−0.5190.531
Ministral-3-8B0.6310.588−0.672+0.539−0.2090.141−0.328+0.306+
Mistral-Small-3.2-24B0.5450.5570.603+0.620+0.2310.127−0.2500.338+
gpt-oss-20b0.5790.5730.6200.630+0.3250.152−0.3690.427+
gpt-oss-120b0.7260.674−0.7130.7340.4940.275−0.559+0.454

TS = ToolSandbox (207 scenarios), BFCL = multi-turn subset of BFCL-v4 (160 tasks). Frontier models show the same pattern on ToolSandbox: GPT-4.1 scores 0.724 / 0.709 / 0.725 / 0.729 and GPT-5.1 scores 0.701 / 0.694 / 0.702 / 0.702 for Base / ToolNet / H-EPM / Insight.

Inference Cost on ToolSandbox (nine-model average per scenario; ratio to Base in parentheses)

MetricBaseToolNetH-EPMInsight
LLM calls5.375.15 (0.96×)14.62 (2.72×)5.54 (1.03×)
Tokens8,6815,937 (0.68×)19,225 (2.21×)12,404 (1.43×)

Ablations on ToolSandbox (tool calls relative to Base in flipped scenarios in parentheses)

ConditionMistral-Small-3.2-24Bgpt-oss-20bgemma-4-E4B-it
Base (only LLMs)0.5450.5790.588
Tool graph memory (H-EPM)0.603+ (2.0)0.620 (1.8)0.554 (2.0)
H-EPM with random tools0.571 (2.3)0.663+ (2.7)0.553 (2.0)
H-EPM with the correct tool (oracle)0.682+ (1.6)0.643+ (2.5)0.666+ (2.0)
H-EPM w/o suggestions0.602+ (1.7)0.633+ (2.7)0.598 (1.9)
H-EPM w/o summarization0.595+ (1.8)0.633+ (2.6)0.604 (1.8)
Base + instruction0.594 (1.9)0.645+ (2.7)0.621+ (2.0)
Insight memory + H-EPM0.600+ (2.5)0.585 (2.7)0.617 (2.8)
Insight memory + instruction0.671+ (2.2)0.675+ (3.0)0.640 (2.7)

Why It Matters

Memory for tool-use agents has gravitated toward structured representations that prescribe the next action. This paper provides the first rigorous, significance-tested audit of that idea for tool graph memory and shows that the apparent benefit is largely an artifact of extra computation: the same boost is available from a one-line instruction, and the graph's guidance is more often misleading than helpful.

Links

Dialogue Efficiency