Skip to content
Preprint

Lost in Compression: A Controlled Cross-Lingual Audit of Extractive Prompt Compressors

Jul 2026 · 1 citation · ⚡ 1 influential · 23 references
Computer Science

TL;DR

A translate-then-compress pipeline matches or beats native compression at roughly half the token cost in three of five tested languages, and safe compression budgets are much smaller outside English.

Abstract

Extractive prompt compression promises to cut LLM inference costs by removing low-information tokens, and learned compressors such as LLMLingua-2 report strong results on English benchmarks. Most other languages already pay a token premium: the same content costs 1.3-1.8x more tokens than in English. We ask whether compression closes or widens this gap. Using fully parallel data in ten languages spanning five scripts, with controls budget-matched in the target model's tokenizer, we audit four learned compressors against four deterministic baselines, on eleven target models from ten vendors (over 250,000 evaluation calls). Three of the compressors are trained with English supervision (LLMLingua-2 XLM-R/mBERT; Kompress-v2 from the production Headroom stack); the fourth, XProvence, is trained multilingually. First, the transfer gap is real, replicates across target models and compressor backbones, and is strongly rate-dependent: at a 0.33 keep-rate English retains 57-62% of normalized context utilization while Lithuanian retains 10-24% and Chinese essentially none, despite Chinese having the smallest token premium. Second, the gap tracks compression supervision data, not architecture. All three English-trained compressors show it, deterministic methods show no comparable gap, and the multilingually trained XProvence v1 shows none. Its v2 release, retrained on translated data, empties 92% of Chinese contexts at its aggressive threshold without any warning. Third, in a harder long-context setting, aggressive learned compression drives compressed contexts to or below no-context utility in three of five non-English languages. A translate-then-compress pipeline matches or beats native compression at roughly half the token cost in three of five tested languages. We release all code, compressions, and model outputs. Safe compression budgets are much smaller outside English.

View source

Similar papers

#natural language process... Preprint Oct 2026

zip2zip++: Towards Inference-Time Token Compression with Minimal Quality Loss

Dynamic vocabularies built on-the-fly via Lempel-Ziv-Welch (LZW) compression let a language model represent the same text in fewer tokens, but prior work shows that this efficiency comes at a cost to reasoning and perplexity. We show that this quality gap is not a fundamental price of compression but can be substantial...

Sai-Bo Geng, A. Gentilini, Xin-Xian Ma et al. · 0 citations
#natural language process... Preprint Oct 2026

Latent Core Tokenizer: Compress, but Meaningfully

Tokenizers are commonly optimized for compression, but a compact vocabulary does not necessarily distribute its capacity evenly across languages. We introduce the Latent Core Tokenizer (LCT), a language-agnostic approach that separates structural discovery from vocabulary construction. LCT uses Minimum Description Leng...

Felermino D. M. A. Ali, Millicent Ochieng, O. Ekwejunor-Etchie et al. · 0 citations
#natural language process... Preprint Sep 2026

FlexComp: One Model for Every Ratio in Context Compression

FlexComp is proposed, a method-agnostic framework that decouples the ratio from both training and deployment and matches separately trained fixed-ratio specialists with minimal degradation across ICAE, 500xCompressor, and SAC on MRQA.

Kai-Yan Zhao, Zhong-Tao Miao, Akiko Aizawa et al. · 1 citation
#artificial intelligence Preprint Oct 2026

OnlineQAT: On-Policy Distillation for Ultra-Low-Bit Large Language Models

Quantization-aware training (QAT) can recover much of the accuracy lost when large language models are compressed below four bits. Existing re- covery stages, however, are commonly optimized on fixed completions or teacher-generated answers, whereas the deployed quantized model condi- tions on prefixes generated by its...

Wen-Jun Wang, He-Ping Li, Yang-Gan Gu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

How Divergence Becomes Decision Flips in Compressed Language Models

Compression reports summarize how far a compressed language model moved from the dense one, usually by a KL divergence; a deployment that relies on the dense model's outputs needs to know how many of its decisions changed. We show that total variation, not KL, answers this directly. Across 802 compressed and perturbed...

Beatriz Almeida Felício · 0 citations
#machine learning Preprint Oct 2026

Lost in the bf16 Cast: Exporting Ternary Language Models Can Revert Most Low-Learning-Rate Code Changes

In two model families, randomized interventions on the initial distance from the threshold support distance-dependent selection of the codes that fine-tuning changes, and in two model families, randomized interventions on the initial distance from the threshold support distance-dependent selection of the codes that fin...

Avichal Sahai, Nishant Raj, Animesh Srivastava · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.