CascadeBERT: Accelerating Inference of Pre-trained Language Models via Calibrated Complete Models Cascade
This work provides a more reliable and accurate method for accelerating inference in pre-trained language models, which is beneficial for applications requiring faster processing of natural language.
This paper addresses the performance bottleneck of dynamic early exiting in pre-trained language models (PLMs) under high speed-up ratios. It proposes CascadeBERT, a framework that dynamically selects proper-sized and complete models in a cascading manner, achieving a 15% improvement under 4x speed-up compared to existing dynamic early exiting methods on six classification tasks.
Dynamic early exiting aims to accelerate the inference of pre-trained language models (PLMs) by emitting predictions in internal layers without passing through the entire model. In this paper, we empirically analyze the working mechanism of dynamic early exiting and find that it faces a performance bottleneck under high speed-up ratios. On one hand, the PLMs' representations in shallow layers lack high-level semantic information and thus are not sufficient for accurate predictions. On the other hand, the exiting decisions made by internal classifiers are unreliable, leading to wrongly emitted early predictions. We instead propose a new framework for accelerating the inference of PLMs, CascadeBERT, which dynamically selects proper-sized and complete models in a cascading manner, providing comprehensive representations for predictions. We further devise a difficulty-aware objective, encouraging the model to output the class probability that reflects the real difficulty of each instance for a more reliable cascading mechanism. Experimental results show that CascadeBERT can achieve an overall 15\% improvement under 4$\times$ speed-up compared with existing dynamic early exiting methods on six classification tasks, yielding more calibrated and accurate predictions.