BinaryBERT: Pushing the Limit of BERT Quantization
원문 초록
The rapid development of large pre-trained language models has greatly increased the demand for model compression techniques, among which quantization is a popular solution. In this paper, we propose BinaryBERT, which pushes BERT quantization to the limit by weight binarization. We find that a binary BERT is hard to be trained directly than a ternary counterpart due to its complex and irregular loss landscape. Therefore, we propose ternary weight splitting, which initializes BinaryBERT by equivalently splitting from a half-sized ternary network. The binary model thus inherits the good performance of the ternary one, and can be further enhanced by fine-tuning the new architecture after splitting. Empirical results show that our BinaryBERT has only a slight performance drop compared with the full-precision model while being 24x smaller, achieving the state-of-the-art compression results on the GLUE and SQuAD benchmarks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
FIMA-Q: Post-Training Quantization for Vision Transformers by Fisher Information Matrix Approximation
Structured Pruning and Quantization for Learned Image Compression
Efficient Speech Translation through Model Compression and Knowledge Distillation
Addition is almost all you need: Compressing neural networks with double binary factorization
DipSVD: Dual-importance Protected SVD for Efficient LLM Compression
RLRC: Reinforcement Learning-based Recovery for Compressed Vision-Language-Action Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.