Skip to content
Preprint

ReCache: Efficient KV Cache Reuse and Compression for Tool-Augmented LLM Agents

Aug 2026 · 3 citations · 53 references
Computer Science

TL;DR

Results show that separating reusable schema encoding from selective resource access substantially reduces agentic inference costs with limited effectiveness loss.

Abstract

Agentic language models repeatedly encode tool and skill schemas that recur across requests in different combinations and orders, preventing standard prefix caching from reusing their key--value (KV) states. We introduce \textbf{ReCache}, a framework for independently caching resource representations while reducing their inference-time computational and memory overhead. Resource-wise attention removes cross-resource interactions and assigns resource-local positions, producing composition-invariant KV blocks. ReCache then restricts resource visibility to contribution-selected layer--KV-head-group routes and retains only invocation-critical fields through structural and semantic pruning. We evaluate ReCache on a benchmark assembled from seven public tool- and skill-use datasets, including resource-disjoint tests. Resource-wise attention matches dense invocation performance (82.3\% versus 82.4\% Inv-F1) while providing a 3.655$\times$ time-to-first-token speedup. The complete framework reduces allocated KV-tensor memory by 92.43\% and accelerates attention by 1.423$\times$. These results show that separating reusable schema encoding from selective resource access substantially reduces agentic inference costs with limited effectiveness loss. The code is available at https://github.com/EIT-NLP/ReCache.

View source

Similar papers

Plug-and-Play KV Cache Reuse for Low-Latency Retrieval-Augmented Generation

This work studies KV cache reuse for RAG under a strictly plug-and-play regime, where the base language model is left unchanged and no retraining, prompt redefinition, or selective recomputation is performed, and proposes a fine-tuning-free approach that reuses KV states across queries through an anchor-block and posit...

Ye Yue, Zhe-Wei Wang, Fabio Agosto et al. · 0 citations
2026

MiniCache: Reusable Program Caching with Small Model Interfaces for Efficient LLM Inference

MiniCache is a reusable program caching framework that transforms Program-of-Thought programs into parameterized cache objects, enabling reusable computation across structurally similar requests, and consistently improves the trade-off between inference latency, cache reuse, and task quality.

Jing-Quan Chen, Jing-Hua Piao, Jie Feng et al. · 0 citations
Preprint Aug 2026

Every Cache Entry Earns Its Place: Global Allocation of Resolution and Coverage for KV Cache Compression

GraceKV is proposed, a global approach for the allocation of resolution and coverage in KV cache compression, and the compression process is formulated as a global resource allocation problem under a fixed cache budget to validate the effectiveness of global budget allocation in coordinating information coverage and lo...

Haolin Tian, Yuzhe Liu, Tong-Han Wang · 0 citations
Preprint Aug 2026

Preserving Admission Responsibility in Multi-Tenant Large Language Model Prefix Caches

Results show that object-value signals rank what to retain, while persistent responsibility determines which group bears reclamation pressure, which shows that object-value signals rank what to retain, while persistent responsibility determines which group bears reclamation pressure.

Zhi-Yu Wang, Rajkummar Buyya · 2 citations
Book Open access Aug 2026

Structure Is All You Need to Reuse: Accelerating GraphRAG via Meta-Structure-Aware KV Caching

MetaKV is proposed, the first structure-aware KV caching mechanism that explicitly decouples static structural logic from dynamic entity semantics in GraphRAG inference, enabling high-throughput, low-latency GraphRAG without sacrificing adherence to graph topology.

Rui-Kun Luo, C. Gu, Jing Yang et al. · 0 citations
Preprint Aug 2026

PrefixPlace: Provable Prefix Key-Value Placement for Large Language Model Serving under Heterogeneous Compute and Transfer Costs

An epoch-level planner, PrefixPlace, which assigns prefix-complete targets under memory budgets and profiled demand, compute, and transfer costs, and solves a 50,000-node, 16-worker placement in 12.3 s on one processor, enabling timely replanning.

Zhi-Yu Wang, Rajkummar Buyya · 0 citations

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