Challenge: Recent work on dynamic early exiting has neglected the intermediate exits’ architectural designs.
Approach: They propose a framework for learning exits and COmparison-based early exiting to improve PTMs’ early exit performance.
Outcome: The proposed framework achieves the SOTA performance on multi-exit BERT training and dynamic early exiting on pre-trained models.

Similar Papers

BADGE: Speeding Up BERT Inference after Deployment via Block-wise Bypasses and Divergence-based Early Exiting (2023.acl-industry)

Copied to clipboard

Challenge: Recent years have witnessed the rise of many pre-trained language models (PLMs) such as GPT (Radford et al., 2019) and XLNet (Yang e.t al, 2019).
Approach: They propose a framework which consists of two off-the-shelf methods for improving PLMs’ early exiting.
Outcome: The proposed method can reduce the average latency of pre-trained language models and work with other inference speed-up methods like model pruning.
LeeBERT: Learned Early Exit for BERT with cross-level optimization (2021.acl-long)

Copied to clipboard

Challenge: Pre-trained language models are resource exhaustive and computationally expensive for industrial scenarios.
Approach: They propose a learning scheme to learn from each other to speed up inference . they ask each exit to learn the weights of different loss terms, instead of learning only from the last layer .
Outcome: The proposed scheme improves state-of-the-art (SOTA) early exit methods for pre-trained models on the GLUE benchmark.
BERxiT: Early Exiting for BERT with Better Fine-Tuning and Extension to Regression (2021.eacl-main)

Copied to clipboard

Challenge: Existing methods to make exiting decisions are limited to classification tasks . large-scale pre-trained language models such as BERT have brought performance gain but at the cost of heavy computational burden.
Approach: They propose a fine-tuning strategy and a learning-to-exit module to accelerate BERT inference . they propose to make trade-offs between model quality and efficiency by early exiting .
Outcome: The proposed approach improves early exiting for BERT, with better trade-offs . it can be combined with other acceleration methods, and the proposed strategy can be applied to regression tasks.
A Global Past-Future Early Exit Method for Accelerating Inference of Pre-trained Language Models (2021.naacl-main)

Copied to clipboard

Challenge: Existing methods to accelerate inference speed of pre-trained language models are limited to local representations of exit layer . current models are associated with large memory requirement and high computational cost, which slow down inference and further encumber the application of PLMs.
Approach: They propose a method to exit early without passing through all inference layers . they take into consideration all the linguistic information embedded in the past layers a global perspective .
Outcome: The proposed method outperforms existing methods by a large margin . it uses linguistic information embedded in the past layers and future features . the proposed method is scalable and cost-effective .
Accelerating BERT Inference for Sequence Labeling via Early-Exit (2021.acl-long)

Copied to clipboard

Challenge: Existing early-exit mechanisms are designed for sequence-level tasks, rather than sequence labeling.
Approach: They propose to extend sentence-level early-exit to accelerate inference of PTMs . they propose a token-level mechanism that allows partial tokens to exit early at different layers .
Outcome: The proposed approach can save up to 66%75% inference cost with minimal performance degradation.
Early Exit with Disentangled Representation and Equiangular Tight Frame (2023.findings-acl)

Copied to clipboard

Challenge: Existing early exit paradigm relies on training parametrical internal classifiers to complete specific tasks.
Approach: They propose a method to decouple two distinct types of representation and introduce a non-parametric tight frame classifier for improvement.
Outcome: Experiments on monolingual and multilingual tasks show that the proposed method improves over existing methods.
GAML-BERT: Improving BERT Early Exiting by Gradient Aligned Mutual Learning (2021.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to improve the early exiting of natural language processing (NLP) are notoriously gigantic and slow in both training and inference.
Approach: They propose a framework for improving the early exiting of BERT by asking each exit to distill knowledge from each other.
Outcome: The proposed framework outperforms the state-of-the-art (SOTA) BERT early exiting methods on the GLUE benchmark.
PCEE-BERT: Accelerating BERT Inference via Patient and Confident Early Exiting (2022.findings-naacl)

Copied to clipboard

Challenge: Pre-trained language models (PLMs) are the state-of-the-art (SOTA) models for natural language processing (NLP).
Approach: They propose a patient and confident early exiting BERT (PCEE-BERT) that can work with different PLMs and popular model compression methods.
Outcome: The proposed method outperforms existing models on the GLUE benchmarks and achieves different speed-up ratios.
A Simple Hash-Based Early Exiting Approach For Language Understanding and Generation (2022.findings-acl)

Copied to clipboard

Challenge: Existing methods to measure instance difficulty use generalization and threshold-tuning . a new approach to learn to exit is based on hash functions to assign tokens to a fixed exiting layer.
Approach: They propose a Hash-based Early Exiting approach that replaces learn-to-exit modules with hash functions to assign each token to a fixed exiting layer.
Outcome: The proposed approach improves on learning to exit and predicting instance difficulty.
CeeBERT: Cross-Domain Inference in Early Exit BERT (2024.findings-acl)

Copied to clipboard

Challenge: Pre-trained Language Models suffer in inference latency due to their large size.
Approach: They propose an online learning algorithm that dynamically determines early exits of samples based on the level of confidence observed at intermediate layers.
Outcome: The proposed algorithm can speed up the BERT/ALBERT models by 2 - 3.1 with minimal drop in accuracy.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations