Skip to content

DART-SD: Diamond-topology Aware Retrieval and Tuning for Self-Distillation of Multi-Turn Tool-Calling Agents

Aug 2026 · 0 citations · 43 references
Computer Science

TL;DR

This work proposes DART-SD (Diamond-topology Aware Retrieval and Tuning for Self-Distillation), a novel framework that shifts the paradigm from global forcing to topology-guided localized correction, and significantly outperforms traditional full-trajectory baselines.

Abstract

Equipping Large Language Models (LLMs) with multi-turn tool-calling capabilities is essential for building autonomous agents. However, progress is fundamentally limited by the reliance on full-length trajectory imitation. For tasks involving multiple order-independent sub-goals, the optimal solution space forms a vast combinatorial diamond lattice. Forcing this rich topology into monolithic trajectories causes a severe topological collapse, indiscriminately penalizing valid alternative explorations and severely degrading policy diversity. To address this, we propose DART-SD (Diamond-topology Aware Retrieval and Tuning for Self-Distillation), a novel framework that shifts the paradigm from global forcing to topology-guided localized correction. DART-SD first models the execution process as a converging Interaction-State Transition Graph (ISTG), faithfully capturing the inherent diamond topology of successful and failed exploratory paths. During autonomous rollouts, the framework identifies the Critical Topological Breakpoint (CTB) and retrieves success-supported recovery references. Finally, we introduce a progressive self-distillation paradigm through CTB-guided localized supervision, ensuring that the training loss is calculated exclusively on the generated recovery steps while strictly protecting the valid reasoning prefix from destructive gradient updates. Experiments on complex multi-turn tool-calling benchmarks demonstrate that DART-SD significantly outperforms traditional full-trajectory baselines.

View source

Similar papers

Open access 2026

Enhancing Web Search Agents With Self-Play Contrastive Fine-Tuning

This paper proposes TAPE (Trajectory Alignment and exPerience pool Evolution), a novel self-evolving fine-tuning framework designed to enhance the generalization and robustness of web search agents without requiring large-scale human annotation.

Minjae Rhee, Jitong Zou, Tianjun Mo et al. · 3 citations
Book Open access Aug 2026

DualLane: Fast and Reliable LLM Agents for Interactive AIOps via Dual-Path Planning

DualLane, a novel parallel dual-path planning architecture designed for AI agents, adaptively manages the highly skewed frequency distribution characteristic of real-world user queries and underscores the practical viability and effectiveness of adaptive dual-path planning in large-scale, interactive AIOps systems.

Haoyu Wang, Wenxuan Ma, Bing Hu et al. · 0 citations
Jul 2026

DeepSearch-World: Self-Distillation for Deep Search Agents in a Verifiable Environment

DeepSearch-Evolve is presented, a self-distillation framework for web agents built on DeepSearch-World, a deterministic and verifiable environment with reproducible search and page-reading tools that enables scalable self-evolution for long-horizon web agents.

Xinyu Geng, Xuanhua He, Si-Xiang Chen et al. · 1 citation
Preprint Aug 2026

SparkVLA: Stop-Aware Hierarchical VLA with Adaptive Action Chunking for Long-Horizon Manipulation

SparkVLA is presented, a stop-aware hierarchical VLA that resolves this mutual dependency by formulating both decisions as a single ranking: Stop competes against every action-prefix length in a unified candidate set, and the system selects the highest-scoring option, eliminating threshold tuning and requiring only off...

Xun-Yao Lei, Ren-Jun Wu, Tianlin Huo et al. · 1 citation
Conference Open access Sep 2026

PENTESTLLMAGENT: A Task Dependency Graph Planning-Based Multi-Agent Framework for Automated Penetration Testing

PentestLLMAgent is proposed, which integrates a Task Dependency Graph (TDG) for dynamic planning and backtracking; a Hierarchical Multi-Agent Architecture (HMA) with function-calling-based tool invocation, output filtering, and semantic compression, and Executable Knowledge-Guided Command Generation (EKG-CG) for retrie...

Shuo Sheng, Jixin Zhang, Jia Yang et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.