ICaRus: Identical Cache Reuse for Efficient Multi Model Inference
On the map: LLM agents and tool use → Software engineering coding agents
Abstract (arXiv)
Multi model inference has recently emerged as a prominent paradigm, particularly in the development of agentic AI systems. However, in such scenarios, each model must maintain its own Key-Value (KV) cache for the identical prompt, leading to substantial memory consumption. This explosive growth of KV caches forces LLM serving systems to evict previously stored caches, which in turn introduces significant recomputation overhead whenever the evicted caches are required again. Moreover, prefix caching is inherently infeasible across different models, forcing each model to recompute KV cache for the identical prompt, which leads to significant overhead. To alleviate these issues, we propose Identical Cache Reuse (ICaRus), a novel architecture that allows multiple models to share identical KV caches across all layers. ICaRus is based on the key observation that a decoder-only Transformer can be conceptually decomposed into a logical encoder, which generates KV caches, and a logical decoder, which predicts output tokens from the KV caches. ICaRus fine-tunes only the logical decoder while freezing the logical encoder, enabling multiple models to share an identical KV cache. This eliminates cache memory explosion and unexpected evictions while also allowing cross-model reuse of KV caches for new input tokens, thereby removing redundant recomputation in multi model inference achieving both efficiency and scalability. Moreover, by incorporating lightweight adapters such as LoRA, ICaRus parallelizes KV cache generation and next-token prediction during decoding. ICaRus achieves comparable accuracy to task-specific fine-tuned model across a diverse set of tasks, while allowing multiple specialized models to fully share KV caches. ICaRus achieves up to 11.1x lower P95 latency and 3.8x higher throughput in multi agent workflow with 8 different models, compared to conventional multi model system.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in Software engineering coding agents, one of 16 directions in LLM agents and tool use. Builds on 42 of its 48 references that are in the map. First posted on arXiv 27 Feb 2026.
Builds on
42 of 48 references.
Closest ancestors · 1
Same direction, newest first
Other references · 41
- 2017Attention Is All You Needcited by 59,932
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2023Reflexion: Language Agents with Verbal Reinforcement Learningcited by 4,064
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
- 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
29 more
- 2023Improving Factuality and Reasoning in Language Models through Multiagent Debatecited by 1,739
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,332
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,107
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
- 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 791
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
- 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 724
- 2023OpenAssistant Conversations -- Democratizing Large Language Model Alignmentcited by 712
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 571
- 2023Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Modelscited by 551
- 2023Prompt Cache: Modular Attention Reuse for Low-Latency Inferencecited by 255
- 2024ToolACE: Winning the Points of LLM Function Callingcited by 204
- 2023Improving Language Model Negotiation with Self-Play and In-Context Learning from AI Feedbackcited by 202
- 2024Lessons from the Trenches on Reproducible Evaluation of Language Modelscited by 172
- 2023An LLM Compiler for Parallel Function Callingcited by 170
- 2023Large Language Model Routing with Benchmark Datasetscited by 166
- 2024Cost-Efficient Large Language Model Serving for Multi-turn Conversations with CachedAttentioncited by 159
- 2024GSM-Plus: A Comprehensive Benchmark for Evaluating the Robustness of LLMs as Mathematical Problem Solverscited by 155
- 2024No Token Left Behind: Reliable KV Cache Compression via Importance-Aware Mixed Precision Quantizationcited by 99
- 2024Small LLMs Are Weak Tool Learners: A Multi-LLM Agentcited by 92
- 2025Multiagent Finetuning: Self Improvement with Diverse Reasoning Chainscited by 90
- 2023Corex: Pushing the Boundaries of Complex Reasoning through Multi-Model Collaborationcited by 70
- 2024Ensemble Learning for Heterogeneous Large Language Models with Deep Parallel Collaborationcited by 66
- 2024LoRA Land: 310 Fine-tuned LLMs that Rival GPT-4, A Technical Reportcited by 47
- 2024Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoningcited by 38
- 2025The Cost of Dynamic Reasoning: Demystifying AI Agents and Test-Time Scaling from an AI Infrastructure Perspectivecited by 38
- 2024Breaking the Ceiling of the LLM Community by Treating Token Generation as a Classification for Ensemblingcited by 33
- 2024SwiftKV: Fast Prefill-Optimized Inference with Knowledge-Preserving Model Transformationcited by 18
- 2025PaCA: Partial Connection Adaptation for Efficient Fine-Tuningcited by 6
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026Cross-Model KV Cache Transfer in LLM Families: A Closed-Form Linear Mapping for Prefill Reusecited by 10
- 2026KV Cache Translation across Heterogeneous Large Language Modelscited by 4
- 2026Characterization of Multi-Model Agentic AI Systems on General Tasks via Trace-Driven Simulationcited by 3
- 2026CacheBridge: Efficient Cross-Model KV Cache Transfercited by 2
- 2026Unified AI Gateway: A Framework for Joint Model Routing and KV Cache Managementcited by 0
- 2026PReCache: Efficient KV Cache Sharing for Multi-LoRA Agents via Low-Rank Precomputation and Neutral Reconstructioncited by 0
- 2026PReCache: Efficient KV Cache Sharing for Multi-LoRA Agents via Low-Rank Precomputation and Neutral Reconstruction28 Sep 2026
- 2026Unified AI Gateway: A Framework for Joint Model Routing and KV Cache Management7 Sep 2026
- 2026CacheBridge: Efficient Cross-Model KV Cache Transfer1 Sep 2026
- 2026Cross-Model KV Cache Transfer in LLM Families: A Closed-Form Linear Mapping for Prefill Reuse4 Aug 2026
- 2026KV Cache Translation across Heterogeneous Large Language Models31 Jul 2026
- 2026Characterization of Multi-Model Agentic AI Systems on General Tasks via Trace-Driven Simulation1 Jun 2026
Similar, not cited
Close in wording, no citation either way
- 2026RelayCaching: Accelerating LLM Collaboration via Decoding KV Cache Reuse
- 2026OxyGen: Unified KV Cache Management for VLA Inference under Multi-Task Parallelism
- 2026KVCMAS: Efficient KV cache Correction for Shared Context in Multi-Agent Systems
- 2026When KV Cache Reuse Fails in Multi-Agent Systems: Cross-Candidate Interaction is Crucial for LLM Judges
- 2026PolyKV: A Shared Asymmetrically-Compressed KV Cache Pool for Multi-Agent LLM Inference
- 2024DroidSpeak: KV Cache Sharing for Cross-LLM Communication and Multi-LLM Serving
- 2026MemDecay: Region-Aware KV Cache Eviction for Efficient LLM Agent Inference
- 2026RaReCache: Bridging the Gap in Cross-Model KV Cache Reuse via Rank disagreement-based Selective Recomputation