Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference
By Jiaming Tang, Yilong Zhao, Kan Zhu, Guangxuan Xiao, Baris Kasikci, Song Han. International Conference on Machine Learning, 2024
425 citations recorded by the source corpus.
As the demand for long-context large language models (LLMs) increases, models with context windows of up to 128K or 1M tokens are becoming increasingly prevalent. However, long-context LLM inference is challenging since the inference speed decreases significantly as the sequence length grows. This slowdown is primarily caused by loading a large KV cache during self-attention. Previous works have shown that a small portion of critical tokens will dominate the attention outcomes. However, we observe the criticality of a token highly depends on the query. To this end, we propose Quest, a query-aware KV cache selection algorithm. Quest keeps track of the minimal and maximal Key values in KV cache pages and estimates the criticality of a given page using Query vectors. By only loading the Top-K critical KV cache pages for attention, Quest significantly speeds up self-attention without sacrificing accuracy. We show that Quest can achieve up to 2.23x self-attention speedup, which reduces inference latency by 7.03x while performing well on tasks with long dependencies with negligible accuracy loss. Code is available at http://github.com/mit-han-lab/Quest .
Subfields: Artificial Intelligence, Neurology, Signal Processing
View Paper: https://www.semanticscholar.org/paper/1c7db9fb18246787fbe3de6e0eaa370ae749e795
Citations in the corpus
- Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention (2025, neutral): “More related sparse attention meth-ods are introduced in Appendix A.”
- Late Code Chunking: A Code Chunking Strategy for Repository-Level Code Completion (2026, unknown): “Additionally, LC 2 applies an Asymmetric Query– Chunk Sizing strategy, deliberately reducing the query length relative to the Code Retrieval Con-text size to maximize the opportunity for key-term matching (Tang et al., 2024).”