CLLGOct 28, 2022

BEBERT: Efficient and Robust Binary Ensemble BERT

arXiv:2210.15976v224 citationsh-index: 131
AI Analysis

This work addresses efficiency and accuracy challenges for deploying NLP models on resource-constrained devices, representing an incremental improvement over existing binary BERT methods.

The paper tackles the problem of deploying BERT models on edge devices by proposing BEBERT, an efficient binary ensemble BERT that reduces accuracy loss compared to full-precision models, achieving only a 0.3% accuracy drop while saving 15x FLOPs and 13x model size.

Pre-trained BERT models have achieved impressive accuracy on natural language processing (NLP) tasks. However, their excessive amount of parameters hinders them from efficient deployment on edge devices. Binarization of the BERT models can significantly alleviate this issue but comes with a severe accuracy drop compared with their full-precision counterparts. In this paper, we propose an efficient and robust binary ensemble BERT (BEBERT) to bridge the accuracy gap. To the best of our knowledge, this is the first work employing ensemble techniques on binary BERTs, yielding BEBERT, which achieves superior accuracy while retaining computational efficiency. Furthermore, we remove the knowledge distillation procedures during ensemble to speed up the training process without compromising accuracy. Experimental results on the GLUE benchmark show that the proposed BEBERT significantly outperforms the existing binary BERT models in accuracy and robustness with a 2x speedup on training time. Moreover, our BEBERT has only a negligible accuracy loss of 0.3% compared to the full-precision baseline while saving 15x and 13x in FLOPs and model size, respectively. In addition, BEBERT also outperforms other compressed BERTs in accuracy by up to 6.7%.

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