Pith. sign in

REVIEW 1 cited by

SmartBERT: A Promotion of Dynamic Early Exiting Mechanism for Accelerating BERT Inference

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.09266 v2 pith:C4SVHXOJ submitted 2023-03-16 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords exitingearlybertinferencelayersskippingsmartbertcomputation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Dynamic early exiting has been proven to improve the inference speed of the pre-trained language model like BERT. However, all samples must go through all consecutive layers before early exiting and more complex samples usually go through more layers, which still exists redundant computation. In this paper, we propose a novel dynamic early exiting combined with layer skipping for BERT inference named SmartBERT, which adds a skipping gate and an exiting operator into each layer of BERT. SmartBERT can adaptively skip some layers and adaptively choose whether to exit. Besides, we propose cross-layer contrastive learning and combine it into our training phases to boost the intermediate layers and classifiers which would be beneficial for early exiting. To keep the consistent usage of skipping gates between training and inference phases, we propose a hard weight mechanism during training phase. We conduct experiments on eight classification datasets of the GLUE benchmark. Experimental results show that SmartBERT achieves 2-3x computation reduction with minimal accuracy drops compared with BERT and our method outperforms previous methods in both efficiency and accuracy. Moreover, in some complex datasets like RTE and WNLI, we prove that the early exiting based on entropy hardly works, and the skipping mechanism is essential for reducing computation.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Large Language Models with Zero-Shot Adjustable Acceleration

    cs.CL 2025-09 reject novelty 4.0 of 10

    A fine-tuning policy that samples a token-preservation rate from a uniform distribution lets a model be accelerated at inference by setting a pruning knob, without retraining.

Pith tools