arXiv Computation and Language By Wenyuan Li, Guang Li, Dongyuan Li, Keisuke Maeda, Takahiro Ogawa, Miki Haseyama

Benchmarking Task Takeover Across Agent Handoffs

Read the original on arXiv Computation and Language →

The paper introduces HSC-Bench, a benchmark with 1,039 tasks designed to evaluate how well receiving AI models can take over tasks after handoffs. It measures two key aspects: the ability to recover relevant repository evidence and the ability to continue from established conversational, tool, and file-work states. Experiments with six models show that structured handoff information consistently improves evidence recovery and, for most models, continuation performance, while the best performers differ between the two tracks.

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 Computation and Language.

arXiv AI
Oct 26

Knowing When to Stop: The Evidence-Action Gap in Coding Agents

The paper introduces the evidence-action gap, where coding agents persist in tasks even when completion is impossible, despite having sufficient evidence that outside help is needed. To quantify this, the authors present ImpasseBench, a benchmark that injects realistic blockers into repair tasks and marks the step at which evidence becomes sufficient. Across eight models and 19,371 trajectories, they find that many agents still exhaust their budget or make unsafe requests after the evidence threshold, but an escalation tool and external monitor can significantly reduce these failures.

By Tianyu Chen, Xinran Zhao, Vijay Viswanathan, Shoubin Yu, Mingyuan Zhou, Tongshuang Wu
arXiv AI
Oct 5

Reach or Solve? Deep Diving into Agentic RL Gains with Checkpoint Handoffs

The paper introduces checkpoint handoff, an evaluation protocol that separates an agent’s ability to reach useful states from its ability to complete tasks in reinforcement learning. By using one checkpoint as a reacher up to a handoff point and another as a solver from the same replayed history, the authors can measure Reach (how often states within a fixed number of actions from success are achieved) and Solve (how often the task is completed from those states). Experiments on TravelPlanner and ALFWorld show that switching the solver from supervised fine‑tuning to RL yields larger gains when RL is used as the reacher, indicating that RL more effectively finds solvable states.

By Xuan Liu, Jingbin Qian
arXiv AI
5d ago

Evidence-Guided Recovery for AI Agents with Ambiguous Tool Outcomes and Partial Execution

The paper introduces an evidence‑guided recovery framework for AI agents that encounter ambiguous tool outcomes and partial execution, such as timeouts or failures. It defines a shared admissibility check for key expiry, authorization timing, dependencies, and residual effects, and a terminal certificate to distinguish actual goal satisfaction from publicly supported safe completion. In a finite study of 37 assignments, the approach achieved 28 certified completions, and in a larger comparison of 58 paired units, evidence‑guided advice certified 30 completions versus 9 for evidence prompting, demonstrating a significant improvement in task completion rates.

By Genliang Zhu, Xiaobo Chen, Ziyuan Wang, Chu Wang