论文研究 arXiv cs.CL Wed, 07 Oct 2026 正文 ok 229 words

Turnslide:通过遍历有限状态机实现可扩展的多轮数据合成

英文标题:Turnslide: Scalable Multi-Turn Data Synthesis by Walking a Finite-State Machine

Turnslide 提出了一种轻量、全自动的多轮工具调用数据合成框架,将每个 API 建模为有限状态机(FSM),以生成状态合法的工具调用序列。该方法仅需一次 LLM 调用即可将工具序列转换为完整训练样本,避免了为不同领域构建模拟运行环境及在每轮对话中多次调用 LLM 的高成本。论文通过在生成轨迹上微调小型语言模型(SLM)验证数据质量:相较未经变异的基线,FSM 生成数据显著提升下游准确率;与现有方法相比,以少 3.6 至 6.6 倍的 token 达到 70.7% 的完整准确率,高于 63.4% 和 53.7%。该方法有望降低面向特定 API 训练多轮 Agent 和工具调用模型的数据构建门槛。
打开原文相关 2.4 · 机会 3
media2.1 KB media640 B media612 B media380 B media9.1 KB media32.7 KB media22.8 KB media24.2 KB media34.7 KB

中文

[提交于 2026 年 10 月 5 日]

标题:Turnslide:通过遍历有限状态机实现可扩展的多轮数据合成

查看 Aaron Fainman 及其他 9 位作者撰写的论文《Turnslide:通过遍历有限状态机实现可扩展的多轮数据合成》的 PDF。

查看 PDF HTML(实验性)

摘要:小型语言模型(SLM)部署成本低,并可在私有基础设施上运行,但基础模型在多轮工具调用方面通常能力不足;而对其进行微调则需要按 API 划分的数据,这类数据很少存在。现有合成方法对于大规模微调而言成本过高,因为它们往往需要为不同领域构建模拟运行环境,并且在每个生成的对话轮次中进行多次 LLM 调用。我们提出了一种全自动、轻量级的合成框架:该框架将每个 API 建模为有限状态机,将系统表示为抽象状态,这些状态决定何时可以调用各个工具,从而生成状态合法的工具序列;随后只需一次 LLM 调用,即可将这些序列转换为完整样本。我们并非优化多样性,而是针对轮次数、工具序列和任务复杂度设定目标分布。我们通过在生成的轨迹上微调 SLM 来衡量数据质量,结果表明,与未经变异的基线相比,基于 FSM 的生成方法显著提升了下游准确率;相较于现有工作,该方法以少 3.6-6.6$\times$ 的 token,实现了 70.7% 的完整准确率,而对比方法分别为 63.4% 和 53.7%。

提交历史

来自:Gabriela Kadlecová [

查看电子邮件

]

[v1]

2026 年 10 月 5 日,星期一,08:48:26 UTC(2,370 KB)

English / 原文

[Submitted on 5 Oct 2026]

Title:Turnslide: Scalable Multi-Turn Data Synthesis by Walking a Finite-State Machine

View a PDF of the paper titled Turnslide: Scalable Multi-Turn Data Synthesis by Walking a Finite-State Machine, by Aaron Fainman and 9 other authors

View PDF HTML (experimental)

Abstract:Small language models are inexpensive to serve and can run on private infrastructure, but base models are often not good enough at multi-turn tool calling, and fine-tuning them needs per-API data that rarely exists. Existing synthesis methods are too expensive for high-scale fine-tuning, as they often require mock operational environments for different domains and multiple LLM calls per generated conversation turn. We introduce a fully automated, lightweight synthesis framework that models each API as a finite-state machine, representing the system as abstract states that determine when each tool may be called, producing state-valid sequences of tools; sequences are translated into complete examples with a single LLM call. Rather than optimize diversity, we set a target distribution over the number of turns, the tool sequence and task complexity. We measure data quality by fine-tuning SLMs on generated trajectories, showing that our FSM-based generation significantly improves downstream accuracy over an unmutated baseline and, against existing works, reaches 70.7% full accuracy over 63.4% and 53.7% with 3.6-6.6$\times$ fewer tokens.

Submission history

From: Gabriela Kadlecová [

view email

]

[v1]

Mon, 5 Oct 2026 08:48:26 UTC (2,370 KB)