LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909283605544960 |
|---|---|
| author | Pan, Zhuoshi Wu, Qianhui Jiang, Huiqiang Xia, Menglin Luo, Xufang Zhang, Jue Lin, Qingwei Rühle, Victor Yang, Yuqing Lin, Chin-Yew Zhao, H. Vicky Qiu, Lili Zhang, Dongmei |
| author_facet | Pan, Zhuoshi Wu, Qianhui Jiang, Huiqiang Xia, Menglin Luo, Xufang Zhang, Jue Lin, Qingwei Rühle, Victor Yang, Yuqing Lin, Chin-Yew Zhao, H. Vicky Qiu, Lili Zhang, Dongmei |
| contents | This paper focuses on task-agnostic prompt compression for better generalizability and efficiency. Considering the redundancy in natural language, existing approaches compress prompts by removing tokens or lexical units according to their information entropy obtained from a causal language model such as LLaMa-7B. The challenge is that information entropy may be a suboptimal compression metric: (i) it only leverages unidirectional context and may fail to capture all essential information needed for prompt compression; (ii) it is not aligned with the prompt compression objective.
To address these issues, we propose a data distillation procedure to derive knowledge from an LLM to compress prompts without losing crucial information, and meantime, introduce an extractive text compression dataset. We formulate prompt compression as a token classification problem to guarantee the faithfulness of the compressed prompt to the original one, and use a Transformer encoder as the base architecture to capture all essential information for prompt compression from the full bidirectional context. Our approach leads to lower latency by explicitly learning the compression objective with smaller models such as XLM-RoBERTa-large and mBERT.
We evaluate our method on both in-domain and out-of-domain datasets, including MeetingBank, LongBench, ZeroScrolls, GSM8K, and BBH. Despite its small size, our model shows significant performance gains over strong baselines and demonstrates robust generalization ability across different LLMs. Additionally, our model is 3x-6x faster than existing prompt compression methods, while accelerating the end-to-end latency by 1.6x-2.9x with compression ratios of 2x-5x. Our code is available at https://aka.ms/LLMLingua-2. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_12968 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression Pan, Zhuoshi Wu, Qianhui Jiang, Huiqiang Xia, Menglin Luo, Xufang Zhang, Jue Lin, Qingwei Rühle, Victor Yang, Yuqing Lin, Chin-Yew Zhao, H. Vicky Qiu, Lili Zhang, Dongmei Computation and Language Machine Learning This paper focuses on task-agnostic prompt compression for better generalizability and efficiency. Considering the redundancy in natural language, existing approaches compress prompts by removing tokens or lexical units according to their information entropy obtained from a causal language model such as LLaMa-7B. The challenge is that information entropy may be a suboptimal compression metric: (i) it only leverages unidirectional context and may fail to capture all essential information needed for prompt compression; (ii) it is not aligned with the prompt compression objective. To address these issues, we propose a data distillation procedure to derive knowledge from an LLM to compress prompts without losing crucial information, and meantime, introduce an extractive text compression dataset. We formulate prompt compression as a token classification problem to guarantee the faithfulness of the compressed prompt to the original one, and use a Transformer encoder as the base architecture to capture all essential information for prompt compression from the full bidirectional context. Our approach leads to lower latency by explicitly learning the compression objective with smaller models such as XLM-RoBERTa-large and mBERT. We evaluate our method on both in-domain and out-of-domain datasets, including MeetingBank, LongBench, ZeroScrolls, GSM8K, and BBH. Despite its small size, our model shows significant performance gains over strong baselines and demonstrates robust generalization ability across different LLMs. Additionally, our model is 3x-6x faster than existing prompt compression methods, while accelerating the end-to-end latency by 1.6x-2.9x with compression ratios of 2x-5x. Our code is available at https://aka.ms/LLMLingua-2. |
| title | LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression |
| topic | Computation and Language Machine Learning |
| url | https://arxiv.org/abs/2403.12968 |