arXiv AI By Bo Yan, Weikai Lin, Song Wang

The Menu Is an Execution Prior: State-Path Tool Menus for Online Agents

Read the original on arXiv AI →

The paper introduces the State-Path Tool Menu, a method that presents agents with a short, ordered subset of tools before execution, ensuring that both the final action and its prerequisite tools are available in a usable sequence. By learning a pre‑execution route from the request state to the desired outcome, the menu acts as an execution prior, encoding which tools can run from the current state, how outputs satisfy later inputs, and recurring orders from training paths. Experiments on ToolBench show that this approach boosts online success from 0.737 to 0.898 and outperforms several baselines while covering more complete tool chains with fewer tools.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Sep 4

Terminal-Universe: Turning Agent Trajectories into Scalable Terminal Environments

Terminal-Universe is a framework that transforms large collections of terminal‑based agent trajectories into reusable, executable environments. By replaying recorded file operations and completing missing files, it reconstructs the original workspace and task, then synthesizes new tasks and multi‑round interactions. The resulting 37.3k task‑sufficient environments enable significant performance gains when fine‑tuning language models on terminal‑based benchmarks.

By Jie Wu, Zhenru Zhang, Beichen Zhang, Xuwu Wang, Yuhui Su, Mouxiang Chen, Peng Wang, Zhihai Wang, Que Shen, Hao Zhou, An Yang, Fei Huang, Yujiu Yang, Dayiheng Liu
arXiv AI
Oct 9

TaReD: Tool-Aware Recursive Decomposition for Long-Horizon Tasks

TaReD introduces a tool-aware recursive decomposition strategy for long‑horizon tasks, organizing tools into a hierarchy of capabilities and allowing agents to discover and use tools on demand. By aligning subtask decomposition with the required capabilities, the method reduces the unreliability of long execution chains and improves task success rates. Experiments on complex real‑world tasks demonstrate up to a 40‑percentage‑point improvement over baseline approaches.

By Wei-Xiang Mao, Zhi-Kai Chen, De-Chuan Zhan, Han-Jia Ye
arXiv AI
Sep 23

ToolCUA: Towards Optimal GUI-Tool Path Orchestration for Computer Use Agents

ToolCUA is an end‑to‑end agent that learns to optimally orchestrate GUI actions and tool calls for Computer Use Agents. It introduces a staged training pipeline that first scales interleaved GUI‑tool trajectories from static GUI data, then bootstraps decision making with single‑turn reinforcement learning, and finally refines performance via online agentic RL guided by a tool‑efficient path reward. On the OSWorld‑MCP benchmark, ToolCUA achieves 46.85% accuracy, a 66% relative improvement over the baseline and a 3.9% gain over GUI‑only models, setting a new state of the art for comparable‑scale models.

By Xuhao Hu, Xi Zhang, Haiyang Xu, Kyle Qiao, Jingyi Yang, Xuanjing Huang, Jing Shao, Ming Yan, Jieping Ye
arXiv AI
Sep 10

AgentServeSim: Serving-System Simulation and Policy Search for LLM Agent Programs

AgentServeSim is a simulation framework designed to model the execution of large language model (LLM) agent programs, capturing cross‑turn key‑value (KV) state retention, successor turn release, and scheduling decisions. Unlike existing simulators that operate on request streams, AgentServeSim treats the entire agent program as a single unit of execution, using a Program Control Block, Program Orchestrator, Retention Plane, and Dispatch Plane to emulate realistic serving dynamics. Validation against real vLLM deployments on two GPU platforms shows mean job completion time errors below 5.5%, and the simulator enables automated policy search that improves mean JCT by up to 2.8% over hand‑written policies. whyItMatters":"The simulator provides a realistic, CPU‑based tool for evaluating and optimizing LLM agent serving policies, achieving high fidelity to real deployments and enabling measurable performance gains."

By Rakibul Hasan Rajib, Mengxin Zheng, Qian Lou
arXiv Computation and Language
Oct 15

Interlock: From Local Correctness to Task Completion in Long-Horizon Agents

Interlock is a framework that transforms long‑horizon tasks into typed completion graphs, linking evidence, decisions, and required effects through grounding, coupling, and realization edges. It compiles these graphs into a resettable workspace, a public request, and an evaluation rubric, and uses source‑coverage, public‑input, and agent‑as‑judge reviews to ensure that all mandatory requirements are met. Fine‑tuning Qwen3.6 backbones on Interlock‑generated trajectories improves pass rates on AutomationBench, JobBench, and Harvey LAB, showing that the synthesized experience benefits external task environments.

By Linji Hao, Yanji He, Zihan Wang, Hansi Yang, Jiayuan Zhang, Hongyan Hao, Qi Gu, Yan Feng, Han Wu
arXiv AI
Sep 3

Harness Engineering in LLM Tool Use via Agent-Native Reusable Tool Primitives

The paper introduces Tool Primitives, a design that replaces rigid API schemas with natural language interfaces for tool calling, enabling seamless inter-tool communication. It builds ToolFace, a repository of over 25,000 functions that LLMs can dynamically retrieve, and HEART, a harness engineering framework that orchestrates tool use with planning, routing, and verification. Experiments show HEART outperforms fine‑tuned models and leading commercial LLMs while cutting API costs by up to 85%.

By Haibo Jin, Suijin Wang, Xucheng Yu, Haojing Luo, Haohan Wang