🛰️ Daily AI Frontier
‹ back to 2026-08-27

TwinKV: A Composable Repair Pass for KV Cache Eviction via Pairwise Key Redundancy

Research Efficiency & Systems

Ranking

Overall 83
Content 100
Popularity 42

Observed public metrics from 1 member.

Merged summary

TL;DR - TwinKV is a training- and attention-free repair pass that improves existing KV-cache eviction policies by swapping retained redundant tokens for evicted tokens lacking surviving duplicates. It can improve long-context inference under fixed memory budgets, though gains vary by model, policy, compression ratio, and task.

  • A leave-one-out analysis found essentially no correlation between attention magnitude and a token’s causal contribution to an answer (Spearman ρ = -0.004).
  • TwinKV detects pairwise key redundancy, replacing redundant retained “donors” with evicted “orphans” while preserving the original policy’s cache budget and scoring rule.
  • Across LongBench, LooGLE, and RULER, it improved many configurations for several eviction policies; benefits were generally smaller at looser compression and for a strong adaptive baseline near its performance ceiling.
  • Few-shot classification exemplars were a consistent failure case where TwinKV did not help either evaluated model.

Sources (1)

TwinKV: A Composable Repair Pass for KV Cache Eviction via Pairwise Key Redundancy

arXiv cs.CL Hong Chen, Yudong Zeng, Yongwei Huang, Zuhao Ouyang, Junyan Zhang, Xuming Hu 2026-08-27 arXiv:2608.27128
Public signals Semantic Scholar citations 0 · Semantic Scholar influential citations 0
Providers: Hugging Face · N/A OpenAlex · N/A Publisher · N/A Semantic Scholar · Citations 0 · Influential citations 0 X · N/A Fetched 2026-09-14 14:16:02.680594 UTC

TL;DR - TwinKV is a training- and attention-free repair pass that improves existing KV-cache eviction policies by swapping retained redundant tokens for evicted tokens lacking surviving duplicates. It can improve long-context inference under fixed memory budgets, though gains vary by model, policy, compression ratio, and task.

  • A leave-one-out analysis found essentially no correlation between attention magnitude and a token’s causal contribution to an answer (Spearman ρ = -0.004).
  • TwinKV detects pairwise key redundancy, replacing redundant retained “donors” with evicted “orphans” while preserving the original policy’s cache budget and scoring rule.
  • Across LongBench, LooGLE, and RULER, it improved many configurations for several eviction policies; benefits were generally smaller at looser compression and for a strong adaptive baseline near its performance ceiling.
  • Few-shot classification exemplars were a consistent failure case where TwinKV did not help either evaluated model.
item →