TokenSelect: Efficient Long-Context Inference and Length Extrapolation for LLMs via Dynamic Token-Level KV Cache Selection (2025.emnlp-main)
Copied to clipboard
| Challenge: | Rapid advances in Large Language Models have spurred demand for processing extended context sequences . however, performance degradation due to sequence lengths out-of-distribution and excessively long inference times are limiting LLMs in long-context scenarios. |
| Approach: | They propose a training-free method for efficient and accurate long-context inference . they selectively involves a few critical KV cache tokens in attention calculation . |
| Outcome: | The proposed method speeds up attention computation and accelerates inference time while reducing selection overhead. |
Similar Papers
FIER: Fine-Grained and Efficient KV Cache Retrieval for Long-context LLM Inference (2025.findings-emnlp)
Copied to clipboard
Dongwei Wang, Zijie Liu, Song Wang, Yuxin Ren, Jianing Deng, Jingtong Hu, Tianlong Chen, Huanrui Yang
| Challenge: | Key-Value (KV) cache reading latency increases with context lengths hindering LLM inference . important tokens are sparsely distributed across the long context, making existing retrieval inaccurate . |
| Approach: | They propose a method to retain a small fraction of KV cache based on token importance . important tokens are often sparsely distributed across the long context . |
| Outcome: | The proposed method reduces decoding latency by 1.2 to 1.5. |
KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches (2024.findings-emnlp)
Copied to clipboard
Jiayi Yuan, Hongyi Liu, Shaochen Zhong, Yu-Neng Chuang, Songchen Li, Guanchu Wang, Duy Le, Hongye Jin, Vipin Chaudhary, Zhaozhuo Xu, Zirui Liu, Xia Hu
| Challenge: | Long context capability is a crucial competency for large language models as it mitigates the human struggle to digest long-form texts. |
| Approach: | They propose to evaluate 10+ state-of-the-art approaches for long context-capable LLMs. |
| Outcome: | The proposed methods are compared against 10+ state-of-the-art approaches across seven categories of long context tasks. |
NACL: A General and Effective KV Cache Eviction Framework for LLM at Inference Time (2024.acl-long)
Copied to clipboard
Yilong Chen, Guoxia Wang, Junyuan Shang, Shiyao Cui, Zhenyu Zhang, Tingwen Liu, Shuohuan Wang, Yu Sun, Dianhai Yu, Hua Wu
| Challenge: | Large Language Models (LLMs) with extended context windows are expensive and infeasible on fixed memory hardware due to the surprisingly large memory consumption of KV Cache. |
| Approach: | They propose a general framework for long-context KV cache eviction that achieves more optimal and efficient evict in a single operation during the encoding phase. |
| Outcome: | The proposed framework improves performance on short- and long-text tasks by 80% and 76% respectively, reducing KV Cache by up to 5 with over 95% performance maintenance. |
RefreshKV: Updating Small KV Cache During Long-form Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for generating long sequences of tokens are expensive and require memory and computation resources. |
| Approach: | They propose a method that alternates between full context attention and attention over a subset of input tokens during generation. |
| Outcome: | The proposed method achieves comparable speedup to eviction-based methods while improving performance for various long-form generation tasks. |
Adaptive Layer Selection for Layer-Wise Token Pruning in LLM Inference (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable capabilities in processing long contexts. |
| Approach: | They propose a training-free method that adaptively chooses the selection layer for KV cache reduction . they exploit the variance of token ranks ordered by attention score to optimize decoding . |
| Outcome: | The proposed method outperforms state-of-the-art token pruning methods on InfiniteBench, RULER, and NIAH benchmarks. |
KV Pareto: Systems-Level Optimization of KV Cache and Model Compression for Long Context Inference (2026.eacl-industry)
Copied to clipboard
| Challenge: | Long-context Large Language Models (LLMs) face significant memory bottlenecks due to the linear growth of key-value (KV) cache with sequence length. |
| Approach: | They propose a framework that maps the trade-off frontier between total memory consumption and task accuracy across three complementary optimization techniques. |
| Outcome: | The proposed model-specific configurations achieve 68-78% total memory reduction with minimal (1-3%) accuracy degradation on long-context tasks. |
LongAttn: Selecting Long-context Training Data via Token-level Attention (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to select long-context data often rely on sentence-level analysis, which can be greatly optimized in both performance and efficiency. |
| Approach: | They propose a token-level framework which quantifies long-range dependencies for LLMs by calculating token-based dependency strength and distribution uniformity of token scores. |
| Outcome: | The proposed framework quantifies long-range dependencies, enabling more accurate and efficient data selection. |
Discovering the Gems in Early Layers: Accelerating Long-Context LLMs with 1000x Input Token Reduction (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable capabilities in handling long context inputs, but this comes at the cost of increased computational resources and latency. |
| Approach: | They propose an algorithm that uses early LLM layers as filters to select and compress input tokens, reducing the context length for subsequent processing. |
| Outcome: | The proposed method outperforms existing techniques on the Needle in a Haystack task while demonstrating comparable performance on the LongBench challenge. |
DynamicKV: Task-Aware Adaptive KV Cache Compression for Long Context LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing KV cache compression methods enforce a fixed pattern, neglecting task-specific characteristics, which hampers the effective retention of essential information while discarding less important tokens. |
| Approach: | They propose a Task-Aware KV cache mechanism that dynamically adjusts the KV caching size across different layers based on the characteristics of the tasks. |
| Outcome: | The proposed method surpasses state-of-the-art methods by 11% on the LongBench dataset even under extreme compression (0.9%) |
LycheeCluster: Efficient Long-Context Inference with Structure-Aware Chunking and Hierarchical KV Indexing (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing retrieval-based methods compromise semantic integrity through fixed-size chunking and suffer from inefficient linear scanning. |
| Approach: | They propose a method that preserves local semantic coherence through boundary-aware chunking and constructs a recursive hierarchical index rooted in the triangle inequality. |
| Outcome: | The proposed method achieves 3.6 end-to-end inference speedup with negligible degradation in model performance. |