Skip to content

PReCache: Efficient KV Cache Sharing for Multi-LoRA Agents via Low-Rank Precomputation and Neutral Reconstruction

Sep 2026 · 0 citations · 63 references
Computer Science

TL;DR

PReCache is presented, a training-free KV cache sharing framework with two designs, namely PreLRShared and ReBaseShared, that share the base cache computed using the pretrained weights and precompute a compact agent-specific low-rank (LR) cache.

Abstract

Multi-LoRA agent systems enable efficient role specialization by sharing a common backbone model. However, each agent repeatedly processes the growing shared trajectory and constructs its own KV cache, introducing substantial memory and computation redundancy in long-horizon tasks. Existing KV cache sharing methods reduce this repeated prefill, but they either require additional training or architectural constraints or retain substantial model computation. Moreover, direct cache reuse causes the current agent to rely on cache states generated by the previous agent's adapter, weakening the role-specific behavior encoded by its own LoRA. We present PReCache, a training-free KV cache sharing framework with two designs, namely PreLRShared and ReBaseShared, that share the base cache computed using the pretrained weights and precompute a compact agent-specific low-rank (LR) cache. To remove repeated prefill, PreLRShared precomputes each agent's LR cache when the shared context is first processed, allowing the current agent to use its own LR cache without reprocessing context processed by previous agents. To improve sharing accuracy, ReBaseShared reconstructs the shared base cache from adapter-free hidden states, reducing the remaining error caused by the previous agent's adapted representation. To minimize its reconstruction cost, we propose two inference schemes tailored to single-stream inference and concurrent serving, performing the same reconstruction after each agent's turn or alongside its execution, respectively. Across multiple models and agent benchmarks, PreLRShared achieves up to a 3.1x TTFT speedup and a 2.3x improvement in per-request throughput over inference without KV cache sharing. ReBaseShared best preserves accuracy overall among the evaluated cache-sharing methods, with an average drop of only 1.1 points relative to inference without cache sharing.

View source

Similar papers

#machine learning Preprint Sep 2026

KVCMAS: Efficient KV cache Correction for Shared Context in Multi-Agent Systems

KVCMAS is presented, an online KV cache correction framework that represents cross-agent cache deviations using compact low-rank states and seamlessly chains corrections along the agent workflow without an additional reference prefill, establishing KVCMAS as an accurate and scalable KV cache sharing approach for prompt...

Hyesung Jeon, Hyeongju Ha, Seoyoun Lee et al. · 0 citations
#machine learning Preprint Sep 2026

SparseEngine: Sparse-First Inference Engine

Long-context LLM agents accumulate interaction histories that strain KV-cache memory and attention computation. Although sparse attention reduces these costs, heterogeneous cache representations and workflows hinder integration with existing inference engines, while prior sparse-serving abstractions support only specif...

Jitai Hao, Quan-Sheng Gu, Qiang Huang et al. · 0 citations
#artificial intelligence Preprint Oct 2026

LatentRemedy: Efficient Remedy For Non-Prefix KV Cache Reuse in Multi-Agent Systems

Non-prefix KV cache reuse is a promising approach for improving inference efficiency in multi-agent systems as agents share the same context blocks. However, when agents have conflicting tasks, directly reusing non-prefix KV caches across agents can severely degrade model performance, causing up to a 90% drop. Existing...

Zhi-Wei Chen, Zhong-Tao Rao, Wai-Kit Xiu et al. · 0 citations
Preprint Aug 2026

psRL: Efficient Training for Agentic AI via Training-Time Prefix Sharing

This paper proposes psRL (prefix sharing for RL), a new training system for agentic AI designed to exploit prefix redundancy among training samples, and introduces two novel prefix-sharing mechanisms that enable flexible, fine-grained workload distribution across GPU workers.

Mian-Jie Yu, Zi-Zhao Mo, Huanyu Qu et al. · 1 citation
#artificial intelligence Preprint Sep 2026

Receiver-Conditioned Latent Communication gives 94% CacheBack

CacheBack is a simple, robust, training-free instance of receiver conditioning based on the sender's attention weights that improves accuracy and reduces median task-completion latency on FanOutQA and shows comparable improvements across model families that span dense Transformers, Mamba-attention hybrids, and sliding-...

M. Rossi, Prajwal Raghunath, Hao Xuan et al. · 0 citations

Related blog posts

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