SparseLLM / prosparse-llama-2-7b

ProSparse-LLaMA-2-7B

• Model creator: Meta
• Original model: Llama 2 7B
• Fine-tuned by: THUNLP and ModelBest
• Paper: link

Introduction

The utilization of activation sparsity, namely the existence of considerable weakly-contributed elements among activation outputs, is a promising method for inference acceleration of large language models (LLMs) ( Liu et al., 2023 ; Song et al., 2023 ). Concretely, acceleration methods based on activation sparsity usually achieve higher inference speed by making wiser resource allocation and computation policies to avoid resource waste on these weakly-contributed parameters.

Adopting ReLU as the activation function is a straightforward method to achieve activation sparsity. However, most recent mainstream LLMs adopt activation functions without intrinsic sparsity (e.g., GELU and Swish). Some efforts ( Zhang et al., 2022 ; Mirzadeh et al., 2023 ; Zhang et al., 2024 ) introduce ReLU or its variants as the substitutive activation function to help non-ReLU LLMs achieve activation sparsity and inference acceleration, but few can concurrently obtain high sparsity and comparable task-specific performance.

In this work, we introduce a simple and effective sparsification method named "ProSparse" to push LLMs for higher activation sparsity while maintaining comparable performance. By applying ProSparse to Swish-activated LLaMA2-7B, LLaMA2-13B, and MiniCPM-1B, we obtain ReLU-activated models with high sparsity of 89.32%, 88.80%, and 87.89%, respectively, while their performance is comparable to the original version. These present the most sparsely activated models among open-source LLaMA versions and competitive end-size models, considerably surpassing ReluLLaMA-7B (66.98%) and ReluLLaMA-13B (71.56%). Further inference acceleration experiments demonstrate the practical speedup effects of higher sparsity on both PowerInfer and our two sparse GPU operators .

Training Dataset

We train the 7B model on about 34.60 billion tokens within 16,500 steps, including a mixture of the following two categories of data.

• Language modeling datasets:

  • StarCoder

  • Wikipedia

  • Pile

  • Other collected datasets

• Instruction tuning datasets:

  • UltraChat
  • P3 (multiple-choice QA)
  • PAQ
  • Unnatural Instructions
  • Flan
  • Super-Natural Instructions
  • Other collected datasets

Intuitively, training the model with even more tokens or with data of a wider coverage and higher quality will obtain better task-specific performance.

ProSparse: Training Methodology

The training process of ProSparse consists of three steps (refer to Section 3.2 of paper for more details):

1. Activation Function Substitution : We substitute the activation function of FFNs with ReLU and apply continual training;
2. Progressive Sparsity Regularization : We jointly optimize the model on the conventional next-token prediction loss and $L_{1}L\_1$ L 1 ​ regularization loss. The regularization is applied to the sparse intermediate outputs of FFNs with a regularization factor increasing progressively in multiple stages. Specifically, the regularization factor $\lambda \backslash lambda$ λ is set to a small constant for the warmup stage, and then increases along a smooth sine curve for each of the subsequent incremental stages. Each stage is accompanied by certain steps of training. In this way, the model can have more time to adapt to the increasing regularization without radical activation shifts, thus alleviating performance degradation.
3. Activation Threshold Shifting : We finally replace ReLU with FATReLU ( Kurtz et al., 2020 ), a ReLU variant with a positive threshold. This can prune those non-zero weakly-contributed elements in activation outputs and further boost sparsity.

The 7B model is trained on 8 A100 GPUs. The learning rate (LR) is controlled by a cosine scheduler with a peak LR of $3e-53e-5$ 3 e − 5 . The hyper-parameters for each stage (including the regularization factor ${\lambda }_i\backslash lambda\_i$ λ i ​ , the accumulated training steps $T_{i}T\_i$ T i ​ , and the accumulated training tokens) are shown as follows:

Evaluation Results

The evaluation results on the above benchmarks demonstrate the advantage of ProSparse, which is the only method achieving high sparsity and comparable performance to the original Swish-activated LLaMA2. Note that models under all settings are trained with the same number of tokens on the same mixed dataset. Our evaluation is based on the framework UltraEval . The evaluation details are listed as follows:

• Code Generation : We compute the average pass@1 scores on HumanEval (0-shot) and MBPP (3-shot).

• Commonsense Reasoning : We report the average 0-shot accuracies on PIQA, SIQA, HellaSwag, WinoGrande, and COPA.

• Reading Comprehension : We compute the average 0-shot accuracies on BoolQ, LAMBADA, and TyDi QA.

• Other Popular Benchmarks : We report the average accuracies on GSM8K (8-shot), MMLU (5-shot), Big Bench Hard (BBH) (3-shot), and AGI-Eval (0-shot).

Notes : For PIQA, SIQA, HellaSwag, WinoGrande, COPA, BoolQ, LAMBADA, TyDi QA, and AGI-Eval, we obtain the predicted answers based on maximized perplexity. For GSM8K, MMLU, and BBH, the predicted answers are directly generated.

Notes : "Original" refers to the original Swish-activated LLaMA2 versions. ReluLLaMA-7B and ReluLLaMA-13B are available at 7B and 13B respectively. MiniCPM-1B is available at 1B . "ProSparse-7B*", "ProSparse-13B*", and "ProSparse-1B*" denote the ProSparse versions without activation threshold shifting.

Evaluation Issues with LM-Eval

The above results can be replicated with UltraEval . Some abnormal results obtained with other popular frameworks such as LM-Eval are probably attributed to the absence of the cls token <s> , which is not added by default in LM-Eval. A quick temporary fix is shown in the following codes. Other differences in evaluation results may be caused by other reasons, including the few-shot settings, data pre-processing, and extra prompts.

# https://github.com/EleutherAI/lm-evaluation-harness/blob/main/lm_eval/models/huggingface.py#L945
for _, context_enc, continuation_enc in chunk:
    # sanity check
    assert len(context_enc) > 0
    # Note: a trivial fix here
    if context_enc[0] != 1:
        context_enc = [1] + context_enc
    assert len(continuation_enc) > 0
    assert len(continuation_enc) <= self.max_length

Here are the steps to adapting the original vLLM to ProSparse LLaMA models.

1. Replace the file vllm/model_executor/models/llama.py in original vLLM with this file .
2. Replace the contents of the original config.json with this file .
3. Set the environment variable ACT_INFO . To test the version without activation threshold shifting, export ACT_INFO=relu . To test the version with activation threshold shifting, export ACT_INFO=fatrelu_0.01 .

Inference Acceleration Effects

First, we utilize PowerInfer , a state-of-the-art acceleration framework leveraging activation sparsity. As its inference speed and accuracy heavily rely on the performance of activation predictors, we report the activation recall and predicted sparsity (i.e., two key metrics for evaluating the activation predictor) as well as the number of tokens generated per second by PowerInfer (with one A100 GPU and sufficient CPUs). The GGUF files and activation predictors for ProSparse-7B are available at ProSparse-LLaMA-2-7B-GGUF ( duplicate ) and ProSparse-LLaMA-2-7B-Predictor ( duplicate ) respectively.

Moreover, considering the potential inference inaccuracies caused by wrong predictions of activation predictors, we implement two sparse GPU operators for faster accurate inference utilizing activation sparsity. They are responsible for the speedup of two key steps in a gated FFN:

• Step (2) ( S2 ): a fused operator of ReLU and $s\odot \left(x{W}_1^T\right)\backslash mathbf\{s\}\; \backslash odot\; (\backslash mathbf\{x\}\; \backslash mathbf\{W\}\_1^T)$ s ⊙ ( x W 1 T ​ ) ;
• Step (3) ( S3 ): a sparse matrix-vector multiplication operator $x_1{W}_2^T\backslash mathbf\{x\}\_1\; \backslash mathbf\{W\}\_2^T$ x 1 ​ W 2 T ​ .

where $s\backslash mathbf\{s\}$ s , $x\backslash mathbf\{x\}$ x , $x_1\backslash mathbf\{x\}\_1$ x 1 ​ , and $\odot \backslash odot$ ⊙ denote the gating scores, the FFN input hidden states, the intermediate outputs, and the element-wise multiplication respectively. $W_1\backslash mathbf\{W\}\_1$ W 1 ​ and $W_2\backslash mathbf\{W\}\_2$ W 2 ​ are FFN weight matrices.

The acceleration effects of LLMs with different sparsity are displayed as follows. ProSparse, which reaches a high sparsity without performance degradation, can gain the most benefits among all the settings concerned. Refer to Section 4.3 of paper for more details.

Notes : For "Dense" settings, the "Inference Speed" (token/sec) is obtained by llama.cpp , and the time (us) for steps (2) and (3) is measured without sparse GPU operators. For other sparse settings, the "Inference Speed" is obtained by PowerInfer , and sparse GPU operators are applied. ProSparse settings with activation threshold shifting and the MiniCPM architecture are not supported by PowerInfer at present.

License Disclaimer

This model is bound by the license & usage restrictions of the original Llama-2 model and comes with no warranty or guarantees of any kind.

Limitations & Biases

Llama 2 and fine-tuned variants are a new technology that carries risks with use. Testing conducted to date has been in English, and has not covered, nor could it cover all scenarios. For these reasons, as with all LLMs, Llama 2 and any fine-tuned variant's potential outputs cannot be predicted in advance, and the model may in some instances produce inaccurate, biased or other objectionable responses to user prompts. Therefore, before deploying any applications of Llama 2 variants, developers should perform safety testing and tuning tailored to their specific applications of the model.

Please see the Responsible Use Guide available at https://ai.meta.com/llama/responsible-use-guide/

Citation

Please kindly cite using the following BibTeX:

@article{song2024prosparse,
  title={{ProSparse}: Introducing and Enhancing Intrinsic Activation Sparsity within Large Language Models},
  author={Song, Chenyang and Han, Xu and Zhang, Zhengyan and Hu, Shengding and Shi, Xiyu and Li, Kuai and Chen, Chen and Liu, Zhiyuan and Li, Guangli and Yang, Tao and Sun, Maosong},
  year={2024},
  journal={arXiv preprint arXiv:2402.13516},
  url={https://arxiv.org/pdf/2402.13516.pdf}
}

Acknowledgments

The model card is modified from ReluLLaMA-7B .