IdleSpec: Exploiting Idle Time via Speculative Planning for LLM Agents

• URL: http://arxiv.org/abs/2605.22154v1
• Date: Thu, 21 May 2026 08:25:17 GMT
• Title: IdleSpec: Exploiting Idle Time via Speculative Planning for LLM Agents
• Abstract summary: Large language model (LLM)-based agents solve complex tasks by leveraging multi-step reasoning with iterative tool calls and environment interactions.<n>Despite the prevalence of idle time in most agentic scenarios, existing works treat it as an unavoidable overhead.<n>We introduce IdleSpec, a scalable and generic inference approach that leverages idle-time computation to improve agent performance.
• Score: 56.77101184011525
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Large language model (LLM)-based agents solve complex tasks by leveraging multi-step reasoning with iterative tool calls and environment interactions, which incur idle time while waiting for observations. Despite the prevalence of idle time in most agentic scenarios, existing works treat it as an unavoidable overhead or propose restricted solutions that overlook varying computational budgets across different tool calls and future observation uncertainty, thereby leading to suboptimal utilization of idle time. In this paper, we introduce IdleSpec, a scalable and generic inference approach that leverages idle-time computation to improve agent performance while minimizing latency overhead. Specifically, IdleSpec iteratively generates plan candidates during idle periods and, once observations become available, aggregates them to guide the next reasoning step. For effective plan generation under observation uncertainty, IdleSpec samples between complementary drafting strategies (i.e., progressive and recovery) from a learned distribution that is updated via posterior feedback. Our experiments demonstrate that IdleSpec significantly improves agent performance in various agentic scenarios by effectively utilizing idle time. In particular, on the GAIA and FRAMES, IdleSpec achieves 55.6% average accuracy with Gemini-2.5-Flash, surpassing the vanilla baseline without idle-time usage by 5.1%. Furthermore, for MLE-Bench, which involves substantial delay from code executions, IdleSpec achieves performance gains of up to 9.1% on the Any Medal rate, highlighting its generalizability to long-horizon tasks.

Related papers

• AgentSpec: Speculative Decoding for Batch Inference of LLM Agents [21.065887019901293]
  Speculative decoding algorithms exhibit substantial speed degradation under large batch sizes.<n>We propose AgentSpec, a speculative decoding algorithm that addresses the limitations of existing methods for LLM agents.
  arXiv  Detail & Related papers  (2026-08-25T02:49:29Z)
• AOSpec: Action and Observation Co-Speculation for Low-Latency Agent Serving [12.403374013868019]
  We present AOSpec, a framework that co-speculates actions and observations across the full agent-environment loop.<n>For outcomes only execution can reveal, AOSpec launches latency-critical target actions in isolated forks.<n>We show that AOSpec reduces mean end-to-end latency by 11.8-32.5% and p99 latency by up to 42.8%.
  arXiv  Detail & Related papers  (2026-08-01T22:06:52Z)
• Evaluating LLMs on Real-World Software Performance Optimization [11.535003393431348]
  We introduce SWE-Pro, a repository-level benchmark derived from 102 expert-written optimizations from open-source projects.<n>Unlike previous benchmarks, SWE-Pro pairs each task with parameterized tests to evaluate runtime, peak memory, and Time-Weighted Memory Usage.<n>Our evaluation shows that current Large Language Models struggle significantly: runtime gains are negligible, and memory optimizations are nearly non-existent.
  arXiv  Detail & Related papers  (2026-06-24T08:07:41Z)
• SpecEyes: Accelerating Agentic Multimodal LLMs via Speculative Perception and Planning [104.01865949020304]
  Agentic multimodal large language models (MLLMs) achieve remarkable reasoning capabilities through iterative visual tool invocation.<n>However, the cascaded perception, reasoning, and tool-calling loops introduce significant sequential overhead.<n>This overhead, termed agentic depth, incurs prohibitive latency and seriously limits system-level throughput.<n>We propose SpecEyes, an agentic-level speculative acceleration framework that breaks this sequential bottleneck.
  arXiv  Detail & Related papers  (2026-03-24T17:45:47Z)
• Chimera: Latency- and Performance-Aware Multi-agent Serving for Heterogeneous LLMs [62.17306142810532]
  We present Chimera, a predictive scheduling system for multi-agent workflow serving on heterogeneous LLM clusters.<n>Chime traces the best latency, reducing end-to-end latency by 1.2--2.4$times$ and improving task performance by 8.0-9.5 percentage points on average over competitive baselines.
  arXiv  Detail & Related papers  (2026-03-23T17:01:42Z)
• Task-oriented Learnable Diffusion Timesteps for Universal Few-shot Learning of Dense Tasks [48.86985692711283]
  Current diffusion model-based applications exploit the power of learned visual representations from multistep forward-backward Markovian processes for single-task prediction tasks.<n>We propose two modules: Task-aware Timestep Selection (TTS) to select ideal diffusion timesteps based on timestep-wise losses and similarity scores, and Timestep Feature Consolidation (TFC) to consolidate the selected timestep features.<n>Our framework effectively achieves superiority in dense prediction performance given only a few support queries.
  arXiv  Detail & Related papers  (2025-12-29T05:19:01Z)
• Reducing Latency of LLM Search Agent via Speculation-based Algorithm-System Co-Design [35.95362310928356]
  LLM-based search agents achieve strong performance but suffer from severe latency.<n>We revisit this bottleneck through the lens of speculation.<n>We present SPAgent, an algorithm-system co-design framework that expands the role of speculation in search agents to reduce latency.
  arXiv  Detail & Related papers  (2025-11-25T08:15:17Z)
• Stop Wasting Your Tokens: Towards Efficient Runtime Multi-Agent Systems [11.42175340352007]
  We introduce SupervisorAgent, a lightweight and modular framework for runtime, adaptive supervision.<n>SupervisorAgent intervenes at critical junctures to proactively correct errors, guide inefficient behaviors, and purify observations.<n>On the challenging GAIA benchmark, SupervisorAgent reduces the token consumption of the Smolagent framework by an average of 29.45% without compromising its success rate.
  arXiv  Detail & Related papers  (2025-10-30T15:12:59Z)
• $\texttt{SPECS}$: Faster Test-Time Scaling through Speculative Drafts [55.231201692232894]
  $textttSPECS$ is a latency-aware test-time scaling method inspired by speculative decoding.<n>Our results show that $textttSPECS$matches or surpasses beam search accuracy while reducing latency by up to $sim$19.1%.
  arXiv  Detail & Related papers  (2025-06-15T05:50:05Z)
• DASA: Delay-Adaptive Multi-Agent Stochastic Approximation [64.32538247395627]
  We consider a setting in which $N$ agents aim to speedup a common Approximation problem by acting in parallel and communicating with a central server. To mitigate the effect of delays and stragglers, we propose textttDASA, a Delay-Adaptive algorithm for multi-agent Approximation.
  arXiv  Detail & Related papers  (2024-03-25T22:49:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.