QUITO-X: A New Perspective on Context Compression from the Information Bottleneck Theory
On the map: Efficient LLM inference and serving → Prompt and context compression
Abstract (arXiv)
Generative LLM have achieved remarkable success in various industrial applications, owing to their promising In-Context Learning capabilities. However, the issue of long context in complex tasks poses a significant barrier to their wider adoption, manifested in two main aspects: (i) The excessively long context leads to high costs and inference delays. (ii) A substantial amount of task-irrelevant information introduced by long contexts exacerbates the "lost in the middle" problem. Existing methods compress context by removing redundant tokens using metrics such as self-information or PPL, which is inconsistent with the objective of retaining the most important tokens when conditioning on a given query. In this study, we introduce information bottleneck theory (IB) to model the problem, offering a novel perspective that thoroughly addresses the essential properties required for context compression. Additionally, we propose a cross-attention-based approach to approximate mutual information in IB, which can be flexibly replaced with suitable alternatives in different scenarios. Extensive experiments on four datasets demonstrate that our method achieves a 25% increase in compression rate compared to the state-of-the-art, while maintaining question answering performance. In particular, the context compressed by our method even outperform the full context in some cases.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in Prompt and context compression, one of 12 directions in Efficient LLM inference and serving. Builds on 21 of its 35 references that are in the map. First posted on arXiv 20 Aug 2024.
Builds on
21 of 35 references.
Closest ancestors · 2
Same direction, newest first
- 2024QUITO: Accelerating Long-Context Reasoning through Query-Guided Context Compression1 Aug
- 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression19 Mar
Other references · 19
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2023GPT-4 Technical Reportcited by 18,396
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,935
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2024Qwen2 Technical Reportcited by 2,120
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,417
- 2020Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Stepscited by 1,282
- 2016Deep Variational Information Bottleneckcited by 930
- 2020Long Range Arena: A Benchmark for Efficient Transformerscited by 700
7 more
- 2018CoQA: A Conversational Question Answering Challengecited by 683
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
- 2021Efficient Attentions for Long Document Summarizationcited by 345
- 2019Quoref: A Reading Comprehension Dataset with Questions Requiring Coreferential Reasoningcited by 100
- 2020The Conditional Entropy Bottleneckcited by 75
- 2023RETA-LLM: A Retrieval-Augmented Large Language Model Toolkitcited by 40
- 2023Self-prompted Chain-of-Thought on Large Language Models for Open-domain Multi-hop Reasoningcited by 21
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025A Survey of Token Compression for Efficient Multimodal Large Language Modelscited by 25
- 2026What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agentscited by 4
- 2026The Compaction Cliff in Long-Running AI Agent Memorycited by 1
- 2026SuPER-Mamba: Surprisal Prioritization for Extended-Context Routing in Mambacited by 0
- 2026SuPER-Mamba: Surprisal Prioritization for Extended-Context Routing in Mamba12 Oct 2026
- 2026The Compaction Cliff in Long-Running AI Agent Memory24 Aug 2026
- 2026What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agents9 Jul 2026
- 2025A Survey of Token Compression for Efficient Multimodal Large Language Models27 Jul 2025
Similar, not cited
Close in wording, no citation either way
- 2024An Information Bottleneck Perspective for Effective Noise Filtering on Retrieval-Augmented Generation
- 2026COMI: Coarse-to-fine Context Compression via Marginal Information Gain
- 2026Fix the Structural Bottleneck: Context Compression via Explicit Information Transmission
- 2025Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retention
- 2024Prompt Compression with Context-Aware Sentence Encoding for Fast and Improved LLM Inference
- 2024Retaining Key Information under High Compression Ratios: Query-Guided Compressor for LLMs
- 2026Density-aware Soft Context Compression with Semi-Dynamic Compression Ratio
- 2024Enhancing and Accelerating Large Language Models via Instruction-Aware Contextual Compression