CLAIOct 28, 2024

LLMCBench: Benchmarking Large Language Model Compression for Efficient Deployment

arXiv:2410.21352v217 citationsh-index: 28Has CodeNIPS
Originality Synthesis-oriented
AI Analysis

This addresses the problem of inefficient deployment of LLMs for researchers and practitioners, but it is incremental as it focuses on benchmarking rather than new compression methods.

The paper tackles the lack of comprehensive evaluation for large language model (LLM) compression techniques by introducing LLMCBench, a benchmark that conducts extensive experiments and analysis, providing insights for algorithm design.

Although large language models (LLMs) have demonstrated their strong intelligence ability, the high demand for computation and storage hinders their practical application. To this end, many model compression techniques are proposed to increase the efficiency of LLMs. However, current researches only validate their methods on limited models, datasets, metrics, etc, and still lack a comprehensive evaluation under more general scenarios. So it is still a question of which model compression approach we should use under a specific case. To mitigate this gap, we present the Large Language Model Compression Benchmark (LLMCBench), a rigorously designed benchmark with an in-depth analysis for LLM compression algorithms. We first analyze the actual model production requirements and carefully design evaluation tracks and metrics. Then, we conduct extensive experiments and comparison using multiple mainstream LLM compression approaches. Finally, we perform an in-depth analysis based on the evaluation and provide useful insight for LLM compression design. We hope our LLMCBench can contribute insightful suggestions for LLM compression algorithm design and serve as a foundation for future research. Our code is available at https://github.com/AboveParadise/LLMCBench.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes