arXiv (All)
open access
Distance-KV: Exploiting Relative Distance for Efficient Long-Context Inference
The memory usage and decoding latency of LLM inference grow rapidly with context length. To reduce these costs, key-value (KV) cache compression methods selectively retain cached states based on token importance or differences in attention patterns across heads. However, we discover that retrieval c
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
- TaskPress: Query-Agnostic KV Cache Compression via Task-Guided Pruning#799029
- TaskPress: Query-Agnostic KV Cache Compression via Task-Guided Pruning#797614
- Instance memory models as a general computational framework for exploring language processing: bringing the lexicon to life.#399632
- Attention-Augmented LSTMs for Automatic Homophonic Ciphertext Decipherment#259382
- Joint head tracking and pose estimation for visual focus of attention recognition#456727
Record · ID 1116994
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