Fine- and Coarse-Granularity Hybrid Self-Attention for Efficient BERT
Not on the map. Why?
Abstract (arXiv)
Transformer-based pre-trained models, such as BERT, have shown extraordinary success in achieving state-of-the-art results in many natural language processing applications. However, deploying these models can be prohibitively costly, as the standard self-attention mechanism of the Transformer suffers from quadratic computational cost in the input sequence length. To confront this, we propose FCA, a fine- and coarse-granularity hybrid self-attention that reduces the computation cost through progressively shortening the computational sequence length in self-attention. Specifically, FCA conducts an attention-based scoring strategy to determine the informativeness of tokens at each layer. Then, the informative tokens serve as the fine-granularity computing units in self-attention and the uninformative tokens are replaced with one or several clusters as the coarse-granularity computing units in self-attention. Experiments on GLUE and RACE datasets show that BERT with FCA achieves 2x reduction in FLOPs over original BERT with <1% loss in accuracy. We show that FCA offers a significantly better trade-off between accuracy and FLOPs compared to prior methods.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 32 of its 34 references that are in the map. First posted on arXiv 17 Mar 2022.
Builds on
32 of 34 references.
References · 32
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,801
- 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,538
- 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,242
20 more
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2017Mixed Precision Trainingcited by 1,135
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2019Green AIcited by 620
- 2019Patient Knowledge Distillation for BERT Model Compressioncited by 502
- 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 476
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
- 2019Q8BERT: Quantized 8Bit BERTcited by 296
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 246
- 2019Structured Pruning of Large Language Modelscited by 201
- 2019A Unified MRC Framework for Named Entity Recognitioncited by 199
- 2020Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learningcited by 184
- 2020Training with Quantization Noise for Extreme Model Compressioncited by 145
- 2020Compressing Large-Scale Transformer-Based Models: A Case Study on BERTcited by 95
- 2020Accelerating Training of Transformer-Based Language Models with Progressive Layer Droppingcited by 93
- 2020LadaBERT: Lightweight Adaptation of BERT through Hybrid Model Compressioncited by 45
- 2020BERT-EMD: Many-to-Many Layer Mapping for BERT Compression with Earth Mover's Distancecited by 27
- 2020Pruning Redundant Mappings in Transformer Models via Spectral-Normalized Identity Priorcited by 23
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 1.
4 papers.
- 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matterscited by 73
- 2023AxomiyaBERTa: A Phonologically-aware Transformer Model for Assamesecited by 4
- 2025TreeKV: Smooth Key-Value Cache Compression with Tree Structurescited by 3
- 2026Overlapping Schwarz Attention: Hierarchical Attention via Domain Decompositioncited by 1
- 2026Overlapping Schwarz Attention: Hierarchical Attention via Domain Decomposition16 Jun 2026
- 2025TreeKV: Smooth Key-Value Cache Compression with Tree Structures9 Jan 2025
- 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matters18 Jun 2024
- 2023AxomiyaBERTa: A Phonologically-aware Transformer Model for Assamese23 May 2023