arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.06384cs.CL

GMP*: Well-Tuned Gradual Magnitude Pruning Can Outperform Most BERT-Pruning Methods

Institute of Science and Technology Austria(奥地利科学技术研究所);Neural Magic Inc.(Neural Magic公司)

Eldar Kurtic, Dan Alistarh

英文摘要:

We revisit the performance of the classic gradual magnitude pruning (GMP) baseline for large language models, focusing on the classic BERT benchmark on various popular tasks. Despite existing evidence in the literature that GMP performs poorly, we show that a simple and general variant, which we call GMP*, can match and sometimes outperform more complex state-of-the-art methods. Our results provide a simple yet strong baseline for future work, highlight the importance of parameter tuning for baselines, and even improve the performance of the state-of-the-art second-order pruning method in this setting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑