mlsanityData to 7 Oct 2026

Context Compression Is Not One Thing: Readable Symbolic Re-expression vs. Coherent Summary at Matched Budget

arXiv 2606.14875 ↗First posted 12 Jun 2026cs.CLcited by 1

On the map: Efficient LLM inference and serving → Prompt and context compression

Abstract (arXiv)

We study context compression for multi-hop question answering with small language models. We propose Telegraph English, a readable symbolic format that rewrites retrieved passages into structured entity-relation statements, preserving reasoning evidence at lower token cost. In controlled experiments on MuSiQue, TwoWiki, and HotpotQA, Telegraph English outperforms three matched-budget compression baselines (character-level deletion, truncation, and random sub-sampling) on every dataset, with gains of 13 to 20 F1 percentage point. It also outperforms a coherent prose summary produced by the same encoder on the hardest dataset. A pre-registered depth-interaction hypothesis is null: the advantage does not grow with reasoning depth within datasets. We interpret these results as evidence that readable symbolic re-expression preserves entity content more densely than either natural language or coherent summarization at matched token budget.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Prompt and context compression, one of 12 directions in Efficient LLM inference and serving. Builds on 8 of its 17 references that are in the map. First posted on arXiv 12 Jun 2026.

Builds on

8 of 17 references.

Closest ancestors · 1

Same direction, newest first

  1. 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression19 Mar

Other references · 7

  1. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
  2. 2020Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Stepscited by 1,259
  3. 2021Show Your Work: Scratchpads for Intermediate Computation with Language Modelscited by 871
  4. 2023Learning to Compress Prompts with Gist Tokenscited by 379
  5. 2023Adapting Language Models to Compress Contextscited by 350
  6. 2024Long-Context Language Modeling with Parallel Context Encodingcited by 84
  7. 2026The Architecture of Errors: From Universal Impossibility to Patch-Local LLM Reliabilitycited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Telegraph English: Semantic Prompt Compression via Structured Symbolic Rewriting
  2. 2025BRIEF-Pro: Universal Context Compression with Short-to-Long Synthesis for Fast and Accurate Multi-Hop Reasoning
  3. 2025No Mean Feat: Simple, Strong Baselines for Context Compression
  4. 2025From Context to EDUs: Faithful and Structured Context Compression via Elementary Discourse Unit Decomposition
  5. 2026Relevant but Incomplete: Referential Dangling as a Paradigm-Level Failure Mode in Hard Prompt Compression
  6. 2024BRIEF: Bridging Retrieval and Inference for Multi-hop Reasoning via Compression
  7. 2026IterCOMP: Reasoning-aware Adaptive Prompt Compression for Multi-hop Question Answering
  8. 2024Prompt Compression with Context-Aware Sentence Encoding for Fast and Improved LLM Inference