analiza aiqbench
MiniCache addresses the high inference costs of agentic LLMs by introducing a caching framework that leverages small models for semantic extraction and speculative drafting, significantly reducing latency without compromising task quality. This approach reframes lightweight models not as replacements but as essential interfaces to optimize reusable computation in program-aided reasoning systems. The technique offers immediate practical value for deploying efficient AI agents at scale where cost and speed are critical constraints.
MiniCache: Reusable Program Caching with Small Model Interfaces for Efficient LLM Inference
arXiv:2607.20507v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly used for program-aided reasoning, agentic decision making, and structured task execution, but these applications often incur high inference cost. We present MiniCache, a reusable program caching framework that transforms Program-of-Thought (PoT) programs into parameterized cache objects, enabling reusable computation across structurally similar requests. MiniCache reuses the same small model for semantic variable extraction on cache-hit requests and speculative drafting during target-LLM generation, reducing expensive target-LLM invocations while preserving task quality. Experiments on shopping-style request datasets, WebShop, Formula, and CodeTAT-QA demonstrate that MiniCache improves the trade-off between inference latency, cache reuse, and accuracy, achieving up to 3.1x lower latency and 2.8x higher throughput under parallel serving. These results show that small models are most effective not as replacements for large models, but as lightweight interface models that enable reliable and efficient reusable program caching.
Abstract:Large language models (LLMs) are increasingly used for program-aided reasoning, agentic decision making, and structured task execution, but these applications often incur high inference cost. We present MiniCache, a reusable program caching framework that transforms Program-of-Thought (PoT) programs into parameterized cache objects, enabling reusable computation across structurally similar requests. MiniCache reuses the same small model for semantic variable extraction on cache-hit requests and speculative drafting during target-LLM generation, reducing expensive target-LLM invocations while preserving task quality. Experiments on shopping-style request datasets, WebShop, Formula, and CodeTAT-QA demonstrate that MiniCache improves the trade-off between inference latency, cache reuse, and accuracy, achieving up to 3.1x lower latency and 2.8x higher throughput under parallel serving. These results show that small models are most effective not as replacements for large models, but as lightweight interface models that enable reliable and efficient reusable program caching.
Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
arXiv:2607.20507 [cs.AI]
(or arXiv:2607.20507v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2607.20507 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 236 cuvinte
Subiecte conexe

Why do models task game?
AI Alignment Forum · 6 aug. 2026
clifford qc: A Python Toolkit for Quantum Simulation
arXiv · 22 sept. 2026

A Candid Abacus AI Review: The All-in-One AI Platform for Professionals & Enterprises
KDnuggets · 10 sept. 2026

How to Use Kimi K3: Moonshot AI’s 2.8T Open-Weight Model
Analytics Vidhya · 24 aug. 2026