{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:21:30Z","timestamp":1780636890662,"version":"3.54.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Artif. Intell."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1109\/tai.2024.3363686","type":"journal-article","created":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T14:06:46Z","timestamp":1707401206000},"page":"2505-2516","source":"Crossref","is-referenced-by-count":11,"title":["Explainable Attention Pruning: A Metalearning-Based Approach"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6747-6367","authenticated-orcid":false,"given":"Praboda","family":"Rajapaksha","sequence":"first","affiliation":[{"name":"Samovar, Telecom SudParis, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2962-192X","authenticated-orcid":false,"given":"Noel","family":"Crespi","sequence":"additional","affiliation":[{"name":"Samovar, Telecom SudParis, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.195"},{"key":"ref2","article-title":"I-BERT: Integer-only BERT\n                        quantization","volume-title":"Proc. Int. Conf. Mach.\n                        Learn.","author":"Kim","year":"2021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-021-01453-z"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3487045"},{"key":"ref5","article-title":"A survey on model compression for natural language\n                        processing","author":"Xu","year":"2022"},{"key":"ref6","article-title":"Reducing transformer depth on demand with structured\n                        dropout","author":"Fan","year":"2019"},{"key":"ref7","article-title":"Are sixteen heads really better than\n                        one?","volume-title":"Proc. Adv. Neural Inf. Process.\n                        Syst. 32","author":"Michel","year":"2019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1580"},{"key":"ref9","first-page":"20378","article-title":"Movement pruning: Adaptive sparsity by\n                        fine-tuning","volume-title":"Proc. Adv. Neural Inf.\n                        Process. Syst. 33","author":"Sanh","year":"2020"},{"key":"ref10","article-title":"Lottery tickets in linear models: An analysis of\n                        iterative magnitude pruning","author":"Elesedy","year":"2020"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3056950"},{"key":"ref13","article-title":"Train big, then compress: Rethinking model size\n                        for efficient training and inference of\n                    transformers","volume-title":"Proc. Int. Conf. Mach.\n                        Learn.","author":"Li","year":"2020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.259"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W18-5446"},{"key":"ref16","article-title":"Towards understanding iterative magnitude pruning:\n                        Why lottery tickets win","author":"Maene","year":"2021"},{"key":"ref17","article-title":"Learned threshold\n                    pruning","author":"Azarian","year":"2020"},{"key":"ref18","article-title":"The state of sparsity in deep neural\n                        networks","author":"Gale","year":"2019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2870052"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-3020"},{"key":"ref21","article-title":"Learning both weights and connections for efficient\n                        neural network","volume-title":"Proc. Adv. Neural Inf.\n                        Process. Syst. 28","author":"Han","year":"2015"},{"key":"ref22","article-title":"BERT: Pre-training of deep bidirectional\n                        transformers for language understanding","author":"Devlin","year":"2018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00018"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W19-4828"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.260"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.repl4nlp-1.18"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.csl.2022.101429"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.829"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.107"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2023.3327163"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1445"}],"container-title":["IEEE Transactions on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9078688\/10571778\/10429777.pdf?arnumber=10429777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T01:09:03Z","timestamp":1755911343000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10429777\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":31,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tai.2024.3363686","relation":{},"ISSN":["2691-4581"],"issn-type":[{"value":"2691-4581","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6]]}}}