S4T-GPTQ: A Space-for-Time Strategy For Optimizing GPTQ 4-bit Quantization
Frequent global memory accesses and computational complexity often become significant performance bottlenecks in large language model (LLM) inference. To address this challenge, this paper proposes a space-for-time strategy for opti-mizing GPTQ 4-bit quantization, namely S4T-GPTQ. The S4T-GPTQ leverages shared memory blocks to store intermediate results, significantly reducing the number of global memory accesses. Experimental results show that S4T-GPTQ improves the inference throughput and reduces the inference latency of the GPTQ 4-bit quantization under the vLLM framework. These enhancements provide an efficient and practical solution for deploying large language models (LLMs) in high-throughput, low-latency scenarios.
Authors
- Huanqing Cui (ORCID: https://orcid.org/0000-0002-9251-680X)
- Shouhua Zhang (ORCID: https://orcid.org/0000-0002-8225-1350)
- Yaozheng Zhang
- Jiehan Zhou (ORCID: https://orcid.org/0000-0002-4026-1649)
- Yuhao Peng
- Yunpeng Liu (ORCID: https://orcid.org/0000-0002-7942-2112)
- Haojie Zhou (ORCID: https://orcid.org/0000-0002-2536-2222)
- Mengxiao Wang (ORCID: https://orcid.org/0000-0003-4904-463X)
Institutions
- Jiangnan University (CN)
- Oulu University of Applied Sciences (FI)
- Shandong University of Science and Technology (CN)
- University of Oulu (FI)
Publication Details
- Published
- 2025-05-23
- DOI
- https://doi.org/10.1109/icmlt65785.2025.11193187
- Primary Topic
- Advanced Data Compression Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00