GRAFT: Graph-Tokenized LLMs for Tool Planning
Xinyi Gao, Xinyu Ren, Junliang Yu, Tong Chen, Quoc Viet Hung Nguyen, Hongzhi Yin

TL;DR
GRAFT is a novel framework that internalizes tool dependency graphs within language models to improve the accuracy and reliability of multi-step tool planning in complex workflows.
Contribution
It introduces a graph-tokenized approach and on-policy distillation to better align tool plans with subtask structures, surpassing existing external graph-use methods.
Findings
GRAFT achieves state-of-the-art exact sequence matching.
It significantly improves dependency legality in tool planning.
The method enhances reliability in complex LLM workflows.
Abstract
Large language models (LLMs) are increasingly used to complete complex tasks by selecting and coordinating external tools across multiple steps. This requires aligning tool choices with subtask intent while satisfying directional execution dependencies among tools. To do this, existing methods model these dependencies as tool graphs and incorporate the graphs with LLMs through retrieval, serialization, or prompt-level injection. However, these external graph-use strategies all follow a matching paradigm, which often fails to align tool choices with the underlying subtask structure, producing semantically plausible plans that violate graph constraints. This issue is further exacerbated by error accumulation, where an early incorrect tool selection shifts the plan into an invalid graph state and causes subsequent predictions to drift away from the valid execution path. To address these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
