mlsanityData to 7 Oct 2026

No Parameters Left Behind: Sensitivity Guided Adaptive Learning Rate for Training Large Transformer Models

arXiv 2202.02664 ↗First posted 6 Feb 2022cs.CL cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

Recent research has shown the existence of significant redundancy in large Transformer models. One can prune the redundant parameters without significantly sacrificing the generalization performance. However, we question whether the redundant parameters could have contributed more if they were properly trained. To answer this question, we propose a novel training strategy that encourages all parameters to be trained sufficiently. Specifically, we adaptively adjust the learning rate for each parameter according to its sensitivity, a robust gradient-based measure reflecting this parameter's contribution to the model performance. A parameter with low sensitivity is redundant, and we improve its fitting by increasing its learning rate. In contrast, a parameter with high sensitivity is well-trained, and we regularize it by decreasing its learning rate to prevent further overfitting. We conduct extensive experiments on natural language understanding, neural machine translation, and image classification to demonstrate the effectiveness of the proposed schedule. Analysis shows that the proposed schedule indeed reduces the redundancy and improves generalization performance.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 37 of its 60 references that are in the map. First posted on arXiv 6 Feb 2022.

Builds on

37 of 60 references.

References · 37

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  4. 2020Language Models are Few-Shot Learnerscited by 32,199
  5. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  6. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  8. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  9. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  10. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  11. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
  12. 2017Decoupled Weight Decay Regularizationcited by 1,722
25 more
  1. 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,486
  2. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  3. 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 998
  4. 2018Neural Network Acceptability Judgmentscited by 952
  5. 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
  6. 2019Are Sixteen Heads Really Better than One?cited by 803
  7. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  8. 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
  9. 2018Rethinking the Value of Network Pruningcited by 595
  10. 2019Importance Estimation for Neural Network Pruningcited by 531
  11. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
  12. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  13. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  14. 2019SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimizationcited by 253
  15. 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 246
  16. 2018Scaling Neural Machine Translationcited by 204
  17. 2019Structured Pruning of Large Language Modelscited by 201
  18. 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
  19. 2018Faster gaze prediction with dense networks and Fisher pruningcited by 92
  20. 2016Edinburgh Neural Machine Translation Systems for WMT 16cited by 76
  21. 2019Global Sparse Momentum SGD for Pruning Very Deep Neural Networkscited by 70
  22. 2021Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalizationcited by 56
  23. 2019The Generalization-Stability Tradeoff In Neural Network Pruningcited by 54
  24. 2020A Gradient Flow Framework For Analyzing Network Pruningcited by 35
  25. 2020The Microsoft Toolkit of Multi-Task Deep Neural Networks for Natural Language Understandingcited by 28

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 5; 2023: 7; 2024: 1; 2025: 1; 2026: 1.

15 papers.

Sort: