AUBER: Automated BERT Regularization
Not on the map. Why?
Abstract (arXiv)
How can we effectively regularize BERT? Although BERT proves its effectiveness in various downstream natural language processing tasks, it often overfits when there are only a small number of training instances. A promising direction to regularize BERT is based on pruning its attention heads based on a proxy score for head importance. However, heuristic-based methods are usually suboptimal since they predetermine the order by which attention heads are pruned. In order to overcome such a limitation, we propose AUBER, an effective regularization method that leverages reinforcement learning to automatically prune attention heads from BERT. Instead of depending on heuristics or rule-based policies, AUBER learns a pruning policy that determines which attention heads should or should not be pruned for regularization. Experimental results show that AUBER outperforms existing pruning methods by achieving up to 10% better accuracy. In addition, our ablation study empirically demonstrates the effectiveness of our design choices for AUBER.
Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). First posted on arXiv 30 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2.
4 papers.
- 2024A Comprehensive Survey of Compression Algorithms for Language Modelscited by 15
- 2025Unifying Uniform and Binary-coding Quantization for Accurate Compression of Large Language Modelscited by 5
- 2025Accurate Sublayer Pruning for Large Language Models by Exploiting Latency and Tunability Informationcited by 2
- 2023Can persistent homology whiten Transformer-based black-box models? A case study on BERT compressioncited by 1
- 2025Unifying Uniform and Binary-coding Quantization for Accurate Compression of Large Language Models4 Jun 2025
- 2025Accurate Sublayer Pruning for Large Language Models by Exploiting Latency and Tunability Information4 Jun 2025
- 2024A Comprehensive Survey of Compression Algorithms for Language Models27 Jan 2024
- 2023Can persistent homology whiten Transformer-based black-box models? A case study on BERT compression17 Dec 2023