Microsoft's LLMLingua-2 Shrinks LLM Prompts 5x Without Rewriting a Word
Microsoft's LLMLingua-2 BERT compressor crosses 800K+ downloads, trending on Hugging Face. Reframes prompt compression as token classification instead of entropy scoring, guaranteeing extractive faithfulness.
Takeaways
- Microsoft's LLMLingua-2 BERT compressor crosses 800K+ downloads, trending on Hugging Face.
- Reframes prompt compression as token classification instead of entropy scoring, guaranteeing extractive faithfulness.
- Delivers 3-6x faster compression and 1.6-2.9x end-to-end latency gains at 2-5x compression ratios.
- Training data distilled from GPT-4, which chose which tokens to keep per content density.
- 0.2B params, Apache 2.0, multilingual BERT backbone, drop-in via the
llmlinguaPyPI package. - Paper: arXiv 2403.12968 ; project page at llmlingua.com .
Microsoft’s model card recently showed more than 800,000 downloads in Hugging Face’s recent-download counter, while the checkpoint appeared high on the platform’s trending list. Hugging Face counts qualifying file requests, so CI jobs, containers, and repeated cold starts can all contribute to the total. Even with that caveat, the activity points to demand for a practical way to reduce prompt length before calling a metered language model.
The checkpoint belongs to the LLMLingua-2 family described in the LLMLingua-2 paper . It uses a roughly 0.2-billion-parameter BERT encoder to classify each input token as keep or drop. The selected tokens remain in their original order, producing a shorter prompt for GPT-4, Claude, or another downstream model.
| Field | Details |
|---|---|
| Task | Extractive prompt compression |
| Architecture | Multilingual BERT encoder |
| Output | Input tokens selected in their original order |
| Training domain | Distilled meeting transcripts |
| License | Apache 2.0 |
A keep-or-drop decision for every token
Earlier prompt compressors often ranked tokens with information entropy, a measure of how unpredictable each token appears to a smaller causal language model. That approach reads context from left to right and optimizes a proxy for predictability rather than the downstream compression task.
LLMLingua-2 trains directly on keep-or-drop labels and uses bidirectional attention, allowing each decision to consider text on both sides of a token. Because the encoder selects from the source instead of generating replacement prose, it avoids invented wording and paraphrase drift. Compression can still remove information that the downstream model needs, so extractive output should not be treated as a guarantee of equivalent answers.
Reporting is indexed from AlphaSignal. Rights remain with the original publisher and cited sources.
Read original report
