Skip to content
Preprint

When Do Prompt-Side Agent Playbooks Transfer? Accuracy, Cost, and Runtime Shift in Agent Deployment

Aug 2026 · 0 citations · 20 references
Computer Science

TL;DR

Across benchmarks, transferred and target-derived playbooks both require target-side validation of success, termination, protocol compatibility, and cost, and Frozen transfer is therefore a conditional cold-start option, not a reuse-by-default strategy or a universally preferable alternative to target-side redistillation.

Abstract

Prompt-side playbooks can improve tool-using language agents without retraining, but their portability beyond the source setting is unclear. We study frozen playbook transfer under a shared distill--validate--transfer protocol. On ALFWorld, transfer is beneficial under controlled greedy decoding and, in one near-budget-matched comparison, distilled guidance outperforms five fixed demonstrations. On TAU2-Bench, a prespecified aggregate contrast supports a modest average matched-domain advantage, but global Holm correction retains only one of 135 route-level effects; the remaining grid provides descriptive evidence of compatibility-sensitive heterogeneity. On XBench-DeepSearch, one artifact--runtime pairing preserves useful first-try heuristics while producing repeated queries, delayed stopping, and substantial cost inflation after a context-runtime shift. Across benchmarks, transferred and target-derived playbooks both require target-side validation of success, termination, protocol compatibility, and cost. Frozen transfer is therefore a conditional cold-start option, not a reuse-by-default strategy or a universally preferable alternative to target-side redistillation.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

Coding Agents are Strong Prompt Optimizers

Results suggest that corpus-scale statistical reflection is a viable alternative to iterative search for prompt optimization, and given only a static corpus of agent trajectories, an off-the-shelf coding agent can directly synthesize an optimized prompt, requiring neither environment access nor validation data.

Agamdeep Singh, Srishti Gautam, Priyanshu Gupta et al. · 0 citations
Preprint Aug 2026

CAPO: Constraint-Aware Prompt Optimization for LLM Agents

This work introduces CAPO (Constraint-Aware Prompt Optimization), a primal-dual method that combines pool-based rewrites with adaptive constraint weighting to optimize system prompts under explicit operational constraints.

Victor Ye Dong, Reid Pryzant, Yi Liu et al. · 0 citations
#natural language process... Preprint Aug 2026

Zero-Shot Self-Orchestration with Ledger-Based Control for Improved LLM Coding Performance

The effect of introducing the manager-worker scaffold over a shared filesystem workspace, with no training and no per-benchmark tuning, measured against the same model answering in a single pass is investigated, finding several mechanisms behind the gains.

Victor Gao, Vida Khosrowshahi, Ali Khosrowshahi et al. · 0 citations
Preprint Aug 2026

AsymSpec: Context-Asymmetric Speculative Decoding for Agentic LLMs

AsymSpec, an asymmetric speculative decoding framework that breaks this symmetry: a lightweight drafter reads the full input while the large verifier operates on the compressed view, is proposed, showing that asymmetric context access yields substantial gains precisely when compression discards critical reasoning signa...

Sheng Liang, Yong-Yue Zhang, Nathanael Brian et al. · 1 citation
Preprint Aug 2026

Control Under Compression: Reliability Frontiers for Tool-Using Agents

CompressAgent is introduced, an environment-verified benchmark for ACC compression across nine independently constructed ACCs, three task families, three fixed Qwen API model identifiers, six retained-context budgets, and 15,525 runs, uncovering a nonlinear, method-dependent reliability frontier.

Ying-Han Hou, Zong-You Yang · 3 citations

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