arXiv (All)
open access
ARC-KV: Amortizing Anchor Search for Reconstruction-Based KV Cache Compaction
Long-context large language model inference is bottlenecked by KV caches that grow linearly with sequence length. This burden is especially severe for long, reusable context prefixes, whose cache must serve many downstream queries. Reconstruction-based methods such as Attention Matching achieve stro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- STEPQuant: When and Where Errors Matter in Delta-Rule Recurrent State Quantization#1142464
- STEPQuant: When and Where Errors Matter in Delta-Rule Recurrent State Quantization#1122274
- FLEET: From Logits Entropy to Enhanced Trajectories in Text Generation#1064201
- Comparative Characterization of KV Cache Management Strategies for LLM Inference#1123063
- Leaky Language Models: Stealing Architecture and Inference Optimizations via Per-Token Timing#394323
Record · ID 1132036
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive