mlsanityData to 14 Oct 2026

OVAL: Output-Aware Local Page Bases for KV Cache Retrieval

arXiv 2610.06686 ↗First posted 5 Oct 2026cs.LGcited by 0

On the map: Efficient LLM inference and serving → KV cache optimization

Abstract (arXiv)

Long context inference with large language models becomes increasingly expensive as attention must operate over an ever growing KV cache. Page sparse attention reduces this cost by representing each KV page compactly and retrieving only a subset for each query. Existing retrieval methods are designed to estimate attention scores or page relevance, but their objectives do not directly account for how approximation errors affect the resulting value weighted attention output. We introduce method, an output aware page encoding derived from the joint structure of keys and values while preserving the key information needed for accurate retrieval. method is training free and requires no additional value dependent statistics at inference time. Once constructed, its stored representation has the same size and decode time scoring cost as a key only spectral representation. Across long reasoning, long context understanding, and long generation benchmarks, method consistently improves over the key only spectral baseline and performs competitively with recent KV cache compression and retrieval methods. On long reasoning benchmarks, it achieves strong avg@(k) performance across model benchmark pairs, while matching or surpassing leading baselines on several long context understanding and generation settings with modest decoding overhead. Code is available at urlhttps://github.com/Ashkan13776/oval-kv.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 12 of its 44 references that are in the map. First posted on arXiv 5 Oct 2026.

Builds on

12 of 44 references.

Closest ancestors · 3

Same direction, newest first

  1. 2025FreeKV: Boosting KV Cache Retrieval for Efficient LLM Inference19 May
  2. 2025TokenButler: Token Importance is Predictable10 Mar
  3. 2024DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Heads14 Oct

Other references · 9

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2024Qwen2.5 Technical Reportcited by 4,942
  3. 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,090
  4. 2024Accessing GPT-4 level Mathematical Olympiad Solutions via Monte Carlo Tree Self-refine with LLaMa-3 8Bcited by 158
  5. 2024SeerAttention: Learning Intrinsic Sparse Attention in Your LLMscited by 124
  6. 2024LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoningcited by 91
  7. 2024Challenges in Deploying Long-Context Transformers: A Theoretical Peak Performance Analysiscited by 44
  8. 2026UNIQUE: Universal Top-k Sparse Attention for Training-free Inference and Sparsity-aware Trainingcited by 2
  9. 2026LOCKS: Page-Local Compact Key Summaries for Efficient Long-Context Decodingcited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026PuzzleKV: Page-Wise Low-Rank Decomposition for KV Cache Compression
  2. 2024KV-Compress: Paged KV-Cache Compression with Variable Compression Rates per Attention Head
  3. 2025LouisKV: Efficient KV Cache Retrieval for Long Input-Output Sequences
  4. 2024Not All Heads Matter: A Head-Level KV Cache Compression Method with Integrated Retrieval and Reasoning
  5. 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference
  6. 2025A2ATS: Retrieval-Based KV Cache Reduction via Windowed Rotary Position Embedding and Query-Aware Vector Quantization
  7. 2026SGD-KV: Summarization Guided KV Cache Compression
  8. 2026Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cache