mlsanityData to 14 Oct 2026

Depth-Wise Attention (DWAtt): A Layer Fusion Method for Data-Efficient Classification

arXiv 2209.15168 ↗First posted 30 Sep 2022cs.CL cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Language Models pretrained on large textual data have been shown to encode different types of knowledge simultaneously. Traditionally, only the features from the last layer are used when adapting to new tasks or data. We put forward that, when using or finetuning deep pretrained models, intermediate layer features that may be relevant to the downstream task are buried too deep to be used efficiently in terms of needed samples or steps. To test this, we propose a new layer fusion method: Depth-Wise Attention (DWAtt), to help re-surface signals from non-final layers. We compare DWAtt to a basic concatenation-based layer fusion method (Concat), and compare both to a deeper model baseline -- all kept within a similar parameter budget. Our findings show that DWAtt and Concat are more step- and sample-efficient than the baseline, especially in the few-shot setting. DWAtt outperforms Concat on larger data sizes. On CoNLL-03 NER, layer fusion shows 3.68--9.73% F1 gain at different few-shot sizes. The layer fusion models presented significantly outperform the baseline in various training scenarios with different data sizes, architectures, and training constraints.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 29 of its 39 references that are in the map. First posted on arXiv 30 Sep 2022.

Builds on

29 of 39 references.

References · 29

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  4. 2020Language Models are Few-Shot Learnerscited by 32,419
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  6. 2016Densely Connected Convolutional Networkscited by 6,720
  7. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,893
  8. 2016Layer Normalizationcited by 5,669
  9. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  10. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  11. 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,935
  12. 2016Pointer Sentinel Mixture Modelscited by 3,096
17 more
  1. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
  2. 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
  3. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  4. 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,070
  5. 2018Universal Transformerscited by 647
  6. 2014Neural Turing Machinescited by 644
  7. 2019Learning Deep Transformer Models for Machine Translationcited by 309
  8. 2016Direct Feedback Alignment Provides Learning in Deep Neural Networkscited by 240
  9. 2021BERTnesia: Investigating the capture and forgetting of knowledge in BERTcited by 40
  10. 2018Training Deeper Neural Machine Translation Models with Transparent Attentioncited by 38
  11. 2020Understanding and Improving Encoder Layer Fusion in Sequence-to-Sequence Learningcited by 26
  12. 2020Multi-layer Representation Fusion for Neural Machine Translationcited by 15
  13. 2019Dynamic Layer Aggregation for Neural Machine Translation with Routing-by-Agreementcited by 11
  14. 2020Addressing Some Limitations of Transformers with Feedback Memorycited by 9
  15. 2018Dense Information Flow for Neural Machine Translationcited by 5
  16. 2021Adapting MARBERT for Improved Arabic Dialect Identification: Submission to the NADI 2021 Shared Taskcited by 5
  17. 2018Layer Trajectory LSTMcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 4; 2026: 3.

10 papers.