An Investigation on Different Underlying Quantization Schemes for Pre-trained Language Models
Not on the map. Why?
Abstract (arXiv)
Recently, pre-trained language models like BERT have shown promising performance on multiple natural language processing tasks. However, the application of these models has been limited due to their huge size. To reduce its size, a popular and efficient way is quantization. Nevertheless, most of the works focusing on BERT quantization adapted primary linear clustering as the quantization scheme, and few works try to upgrade it. That limits the performance of quantization significantly. In this paper, we implement k-means quantization and compare its performance on the fix-precision quantization of BERT with linear quantization. Through the comparison, we verify that the effect of the underlying quantization scheme upgrading is underestimated and there is a huge development potential of k-means quantization. Besides, we also compare the two quantization schemes on ALBERT models to explore the robustness differences between different pre-trained models.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 2.
4 papers.
- 2021Vision Transformer Pruningcited by 79
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 64
- 2022HeatViT: Hardware-Efficient Adaptive Token Pruning for Vision Transformerscited by 46
- 2024A Comprehensive Survey of Compression Algorithms for Language Modelscited by 15
- 2024Model Compression and Efficient Inference for Large Language Models: A Survey15 Feb 2024
- 2024A Comprehensive Survey of Compression Algorithms for Language Models27 Jan 2024
- 2022HeatViT: Hardware-Efficient Adaptive Token Pruning for Vision Transformers15 Nov 2022
- 2021Vision Transformer Pruning17 Apr 2021