One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Models

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Shao, Hang, Liu, Bei, Xiao, Bo, Zeng, Ke, Wan, Guanglu, Qian, Yanmin
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929324238569472
author Shao, Hang
Liu, Bei
Xiao, Bo
Zeng, Ke
Wan, Guanglu
Qian, Yanmin
author_facet Shao, Hang
Liu, Bei
Xiao, Bo
Zeng, Ke
Wan, Guanglu
Qian, Yanmin
contents Various Large Language Models~(LLMs) from the Generative Pretrained Transformer(GPT) family have achieved outstanding performances in a wide range of text generation tasks. However, the enormous model sizes have hindered their practical use in real-world applications due to high inference latency. Therefore, improving the efficiencies of LLMs through quantization, pruning, and other means has been a key issue in LLM studies. In this work, we propose a method based on Hessian sensitivity-aware mixed sparsity pruning to prune LLMs to at least 50% sparsity without the need of any retraining. It allocates sparsity adaptively based on sensitivity, allowing us to reduce pruning-induced error while maintaining the overall sparsity level. The advantages of the proposed method exhibit even more when the sparsity is extremely high. Furthermore, our method is compatible with quantization, enabling further compression of LLMs. We have released the available code.
format Preprint
id arxiv_https___arxiv_org_abs_2310_09499
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Models
Shao, Hang
Liu, Bei
Xiao, Bo
Zeng, Ke
Wan, Guanglu
Qian, Yanmin
Computation and Language
Artificial Intelligence
Various Large Language Models~(LLMs) from the Generative Pretrained Transformer(GPT) family have achieved outstanding performances in a wide range of text generation tasks. However, the enormous model sizes have hindered their practical use in real-world applications due to high inference latency. Therefore, improving the efficiencies of LLMs through quantization, pruning, and other means has been a key issue in LLM studies. In this work, we propose a method based on Hessian sensitivity-aware mixed sparsity pruning to prune LLMs to at least 50% sparsity without the need of any retraining. It allocates sparsity adaptively based on sensitivity, allowing us to reduce pruning-induced error while maintaining the overall sparsity level. The advantages of the proposed method exhibit even more when the sparsity is extremely high. Furthermore, our method is compatible with quantization, enabling further compression of LLMs. We have released the available code.
title One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Models
topic Computation and Language
Artificial Intelligence
url https://arxiv.org/abs/2310.09499