Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models

Song Guo, Jiahang Xu, Li Lyna Zhang, Mao Yang
10/8/2023
cs.AI

No official code found. Best implementation: microsoft/Moonlit (88 stars, MIT, last commit 2024-10-25).

Abstract

Despite the remarkable success of Large Language Models (LLMs), the massive size poses significant deployment challenges, particularly on resource-constrained hardware. While existing LLM compression methods focus on quantization, pruning remains relatively unexplored due to the high cost of training-based approaches and data collection challenges. One-shot pruning methods, although cost-effective and data-free, have become dominant in LLM pruning, but lead to performance decline under the structured pruning setting. In this work, we introduce a new paradigm for structurally pruning LLMs, called Compresso. Our approach, through the collaboration of the proposed resource-efficient pruning algorithm and the LLM itself, learns optimal pruning decisions during the training process. Compresso addresses the challenges of expensive training costs and data collection by incorporating Low-Rank Adaptation (LoRA) into the $L_0$ regularization during the instruction tuning process. Then, we further augment the pruning algorithm by introducing a collaborative prompt that fosters collaboration between the LLM and the pruning algorithm, significantly boosting the overall performance. To this end, Compresso prunes LLaMA-7B to 5.4B, maintaining original performance and even surpassing LLaMA-7B in reading comprehension by 2.62%. Extensive experiments demonstrate that Compresso significantly outperforms one-shot pruning baselines across various sparsity ratios, achieving up to 2.21%, 11.43%, 7.04%, and 4.81% higher scores on the commonsense reasoning, reading comprehension, MMLU, and BBH benchmarks, respectively.

View on arXivView PDF

Code Implementations(1)

microsoft/MoonlitCommunity100%
MIT

This is a collection of our research on efficient AI, covering hardware-aware NAS and model compression.

886C++, ShellMay 26, 20231 years agoMIT
inference-efficiencymodel-compressionneural-architecture-searchtoken-pruning

Similar Papers

Cite this paper

@article{guo2023compresso,
  title  = {Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models},
  author = {Song Guo and Jiahang Xu and Li Lyna Zhang and Mao Yang},
  year   = {2023},
  eprint = {2310.05015},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.05015v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.05015.svg)](https://codeofpaper.com/paper/2310.05015)

Discussion