{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:13:19Z","timestamp":1780675999958,"version":"3.54.1"},"reference-count":89,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Researchers Supporting Project number","award":["RSPD2024R1051"],"award-info":[{"award-number":["RSPD2024R1051"]}]},{"name":"King Saud University, Riyadh, Saudi Arabia"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3411776","type":"journal-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T13:28:15Z","timestamp":1718026095000},"page":"89418-89438","source":"Crossref","is-referenced-by-count":8,"title":["Applications of Pruning Methods in Natural Language Processing"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5975-2121","authenticated-orcid":false,"given":"Marva","family":"Touheed","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, COMSATS University Islamabad, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0312-8362","authenticated-orcid":false,"given":"Urooj","family":"Zubair","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, COMSATS University Islamabad, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5322-9808","authenticated-orcid":false,"given":"Dilshad","family":"Sabir","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, COMSATS University Islamabad, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1505-5157","authenticated-orcid":false,"given":"Ali","family":"Hassan","sequence":"additional","affiliation":[{"name":"Department of Computer and Software Engineering, College of Electrical and Mechanical Engineering, National University of Sciences and Technology, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6970-2612","authenticated-orcid":false,"given":"Muhammad Fasih Uddin","family":"Butt","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, COMSATS University Islamabad, Islamabad, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Farhan","family":"Riaz","sequence":"additional","affiliation":[{"name":"School of Computer Science, College of Health and Science, University of Lincoln, Lincoln, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wadood","family":"Abdul","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5239-2443","authenticated-orcid":false,"given":"Rashid","family":"Ayub","sequence":"additional","affiliation":[{"name":"Department of Science Technology and Innovation, College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CONIT51480.2021.9498400"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266.2020.00071"},{"key":"ref3","article-title":"Deep rewiring: Training very sparse deep networks","author":"Bellec","year":"2017","journal-title":"arXiv:1711.05136"},{"key":"ref4","article-title":"Deep compression: Compressing deep neural networks with pruning, trained quantization and Huffman coding","author":"Han","year":"2015","journal-title":"arXiv:1510.00149"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3583781.3590232"},{"key":"ref6","article-title":"Pruning convolutional neural networks for resource efficient inference","author":"Molchanov","year":"2016","journal-title":"arXiv:1611.06440"},{"key":"ref7","article-title":"Pruning filters for efficient ConvNets","author":"Li","year":"2016","journal-title":"arXiv:1608.08710"},{"key":"ref8","article-title":"To prune, or not to prune: Exploring the efficacy of pruning for model compression","author":"Zhu","year":"2017","journal-title":"arXiv:1710.01878"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1580"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120908"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3349971"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2023.101611"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2023.101610"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2022.02.025"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.sustainlp-1.9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3579371.3589040"},{"key":"ref17","article-title":"A survey of model compression and acceleration for deep neural networks","author":"Cheng","year":"2017","journal-title":"arXiv:1710.09282"},{"key":"ref18","article-title":"Efficient, adaptable and interpretable NLP","author":"Rethmeier","year":"2023"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.878"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00958"},{"key":"ref21","first-page":"1607","article-title":"Born again neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Furlanello"},{"key":"ref22","article-title":"Backdoor learning for NLP: Recent advances, challenges, and future research directions","author":"Omar","year":"2023","journal-title":"arXiv:2302.06801"},{"key":"ref23","article-title":"Adversarial attacks on machine learning in embedded and IoT platforms","author":"Westbrook","year":"2023","journal-title":"arXiv:2303.02214"},{"key":"ref24","article-title":"What do compressed large language models forget? Robustness challenges in model compression","author":"Du","year":"2021","journal-title":"arXiv:2110.08419"},{"key":"ref25","first-page":"142","article-title":"Learning word vectors for sentiment analysis","volume-title":"Proc. 49th Annu. Meeting Assoc. Comput. Linguistics, Hum. Lang. Technol.","author":"Maas"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W16-2301"},{"key":"ref27","first-page":"1631","article-title":"Recursive deep models for semantic compositionality over a sentiment treebank","volume-title":"Proc. EMNLP","volume":"1631","author":"Socher"},{"key":"ref28","first-page":"118","article-title":"Named entity recognition: Exploring features","volume":"292","author":"Tkachenko","year":"2012","journal-title":"KONVENS"},{"key":"ref29","article-title":"LLM-pruner: On the structural pruning of large language models","author":"Ma","year":"2023","journal-title":"arXiv:2305.11627"},{"key":"ref30","article-title":"Structured pruning of a BERT-based question answering model","author":"McCarley","year":"2019","journal-title":"arXiv:1910.06360"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-demo.4"},{"key":"ref32","article-title":"Structured pruning of large language models","author":"Wang","year":"2019","journal-title":"arXiv:1910.04732"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP49357.2023.10095780"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.07.083"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.07.049"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2021.3063265"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-022-3646-6"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106471"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.csl.2022.101429"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2020.2975987"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.246"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2022.03.023"},{"key":"ref43","article-title":"PDP: Parameter-free differentiable pruning is all you need","author":"Cho","year":"2023","journal-title":"arXiv:2305.11203"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.829"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED51717.2021.9424344"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.286"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED54688.2022.9806237"},{"key":"ref48","first-page":"20378","article-title":"Movement pruning: Adaptive sparsity by fine-tuning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","volume":"33","author":"Sanh"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.gebnlp-1.6"},{"key":"ref50","article-title":"Exploring sparsity in recurrent neural networks","author":"Narang","year":"2017","journal-title":"arXiv:1704.05119"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218701"},{"key":"ref52","article-title":"Network trimming: A data-driven neuron pruning approach towards efficient deep architectures","author":"Hu","year":"2016","journal-title":"arXiv:1607.03250"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00958"},{"key":"ref54","article-title":"Deep question answering: A new teacher for distilBERT","author":"Preite","year":"2019"},{"key":"ref55","article-title":"Neural pruning via growing regularization","author":"Wang","year":"2020","journal-title":"arXiv:2012.09243"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/K16-1029"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/330"},{"key":"ref58","article-title":"Layer-adaptive sparsity for the magnitude-based pruning","author":"Lee","year":"2020","journal-title":"arXiv:2010.07611"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_32"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3184730"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00810"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3003810"},{"key":"ref63","first-page":"15834","article-title":"The lottery ticket hypothesis for pre-trained BERT networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.211"},{"key":"ref65","first-page":"1","article-title":"Audio lottery: Speech recognition made ultra-lightweight, noise-robust, and transferable","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Ding"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-demo.4"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/BHI.2018.8333439"},{"key":"ref68","article-title":"Can model compression improve NLP fairness","author":"Xu","year":"2022","journal-title":"arXiv:2201.08542"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3410463.3414654"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.541"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/WACV48630.2021.00100"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2171\/1\/012055"},{"key":"ref73","article-title":"Training and inference with integers in deep neural networks","author":"Wu","year":"2018","journal-title":"arXiv:1802.04680"},{"key":"ref74","article-title":"Dynamic sparse graph for efficient deep learning","author":"Liu","year":"2018","journal-title":"arXiv:1810.00859"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2021-248"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSCA53499.2021.9650256"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90321-3_61"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/AEMCSE51986.2021.00254"},{"key":"ref79","article-title":"Unstructured pruning of pre-trained language models tuned for sentiment classification","author":"Nordstr\u00f6m","year":"2022"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W18-5431"},{"key":"ref81","article-title":"Modeling of pruning techniques for deep neural networks simplification","author":"Mousa Pasandi","year":"2020","journal-title":"arXiv:2001.04062"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/ICCEIC54227.2021.00018"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1145\/3615661"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR48806.2021.9412294"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126808"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.3390\/s23020824"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/72.572092"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.3390\/electronics9071059"},{"key":"ref89","first-page":"3025","article-title":"Coarsening the granularity: Towards structurally sparse lottery tickets","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10552272.pdf?arnumber=10552272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T05:59:11Z","timestamp":1769493551000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10552272\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":89,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3411776","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}