arXiv (All)
open access
What Matters for Aggressive Decoding-Time KV Eviction? Temporal Aggregation and Ranking Preservation
Decoding-time KV cache compression research focuses heavily on designing better token scoring functions, while the temporal rule that aggregates scores across decode steps is often treated as an implementation detail. Under aggressive KV compression, we find that exponential-moving-average (EMA) agg
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
- Refusal Before Decoding: Detecting and Exploiting Refusal Signals in Intermediate LLM Activations#926053
- Mind the Approximation: Fisher-Weighted SVD Compression for ViTs#975211
- Greedy Decoding Is Not Precision-Invariant: Cross-Precision Output Divergence in LLM Inference#1062509
- Greedy Decoding Is Not Precision-Invariant: Cross-Precision Output Divergence in LLM Inference#1043092
- Where Compute Matters: Heterogeneous Attention for Efficient Video Diffusion#1105608
Record · ID 926429
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