arXiv (All)
open access
Random Attention: Rethinking KV Cache Eviction for Efficient Reasoning
Large language models achieve superior performance on tasks that require extended reasoning, but long chains of thought make the KV cache a severe memory bottleneck. Existing KV cache compression methods share one paradigm: score each cached token by some estimate of how much it will matter later, a
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
- Towards Efficient Reasoning: Learning Causal Shortcuts for Diffusion Language Models#1064816
- SimpCue: Cue-Based Prompting for Multilingual Text Simplification#784810
- SimpCue: Cue-Based Prompting for Multilingual Text Simplification#783220
- Part Grounding, Not Action Knowledge: Locating the Bottleneck in VLM Affordance Prediction#1071032
- Do New Attention Mechanisms Actually Fix Attention Sinks at Million-Token Context?#985915
Record · ID 926351
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