arXiv (All)
open access
Folding Attention Biases into Keys Makes Compacted KV Caches Run on Standard Kernels
Attention Matching (AM) compacts a KV cache by keeping some keys per head, refitting their values and adding a bias to each kept key's logit. FlashAttention and vLLM's paged caches have no input for it. We fold the bias into the keys along one closed-form direction per head, fitted on context querie
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
- CHERI-D: Secure and efficient inline object ID for CHERI temporal memory safety#1400961
- ExaChem/exachem#679635
- CVE-2026-79393 — HIGH 7.5#781600
- Query Expansion and Key Specialization in Transformer Attention Geometry#1119346
- CVE-2026-103004 — MEDIUM 6.3#1167471
Record · ID 1467844
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