{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T00:13:59Z","timestamp":1777940039318,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T00:00:00Z","timestamp":1777680000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T00:00:00Z","timestamp":1777680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10044-026-01679-y","type":"journal-article","created":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T05:36:31Z","timestamp":1777700191000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A bidirectional importance metric for goal-driven pruning"],"prefix":"10.1007","volume":"29","author":[{"given":"Mehmet Zahid","family":"Akpolat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdullah","family":"Bulbul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,2]]},"reference":[{"key":"1679_CR1","unstructured":"Han S, Mao H, Dally WJ (2015) Deep compression: compressing deep neural networks with pruning, trained quantization and Huffman coding. arXiv preprint arXiv:1510.00149"},{"key":"1679_CR2","unstructured":"Cheng H, Zhang M, Shi JQ (2023) A survey on deep neural network pruning-taxonomy, comparison, analysis, and recommendations"},{"key":"1679_CR3","doi-asserted-by":"crossref","unstructured":"Molchanov P, Mallya A, Tyree S, Frosio I, Kautz J (2019) Importance estimation for neural network pruning. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 11264\u201311272","DOI":"10.1109\/CVPR.2019.01152"},{"key":"1679_CR4","unstructured":"Gale T, Elsen E, Hooker S (2019) The state of sparsity in deep neural networks. arXiv preprint arXiv:1902.09574"},{"key":"1679_CR5","doi-asserted-by":"crossref","unstructured":"Liu Z, Li J, Shen Z, Huang G, Yan S, Zhang C (2017) Learning efficient convolutional networks through network slimming. In: Proceedings of the IEEE international conference on computer vision, pp 2736\u20132744","DOI":"10.1109\/ICCV.2017.298"},{"key":"1679_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107468","volume":"110","author":"C Kaplan","year":"2021","unstructured":"Kaplan C, Bulbul A (2021) Goal driven network pruning for object recognition. Pattern Recognit 110:107468","journal-title":"Pattern Recognit"},{"key":"1679_CR7","first-page":"272","volume-title":"Blackwell handbook of sensation and perception","author":"MM Chun","year":"2005","unstructured":"Chun MM, Wolfe JM (2005) Visual attention. Blackwell handbook of sensation and perception. Wiley, Hoboken, pp 272\u2013310"},{"issue":"3","key":"1679_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1167\/13.3.16","volume":"13","author":"Y Pinto","year":"2013","unstructured":"Pinto Y, Leij AR, Sligte IG, Lamme VA, Scholte HS (2013) Bottom-up and top-down attention are independent. J Vis 13(3):16","journal-title":"J Vis"},{"issue":"6","key":"1679_CR9","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1016\/j.tics.2024.01.005","volume":"28","author":"R Xia","year":"2024","unstructured":"Xia R, Chen X, Engel TA, Moore T (2024) Common and distinct neural mechanisms of attention. Trends Cogn Sci 28(6):554\u2013567","journal-title":"Trends Cogn Sci"},{"key":"1679_CR10","unstructured":"Li H, Kadav A, Durdanovic I, Samet H, Graf HP (2016) Pruning filters for efficient convnets. In: International conference on learning representations"},{"key":"1679_CR11","doi-asserted-by":"crossref","unstructured":"He Y, Liu P, Wang Z, Hu Z, Yang Y (2019) Filter pruning via geometric median for deep convolutional neural networks acceleration. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 4340\u20134349","DOI":"10.1109\/CVPR.2019.00447"},{"key":"1679_CR12","unstructured":"LeCun Y, Denker JS, Solla SA, Howard RE, Jackel LD (1989) Optimal brain damage. In: NIPs, vol 2, pp 598\u2013605"},{"key":"1679_CR13","unstructured":"Han S, Pool J, Tran J, Dally W (2015) Learning both weights and connections for efficient neural network. In: Advances in neural information processing systems, vol 28"},{"key":"1679_CR14","doi-asserted-by":"crossref","unstructured":"Lin M, Ji R, Zhang Y, Zhang B, Wu Y, Tian Y (2020) Channel pruning via automatic structure search. arXiv preprint arXiv:2001.08565","DOI":"10.24963\/ijcai.2020\/94"},{"key":"1679_CR15","unstructured":"Frankle J, Carbin M (2018) The lottery ticket hypothesis: finding sparse, trainable neural networks. arXiv preprint arXiv:1803.03635"},{"key":"1679_CR16","unstructured":"Renda A, Frankle J, Carbin M (2020) Comparing rewinding and fine-tuning in neural network pruning. arXiv preprint arXiv:2003.02389"},{"issue":"5","key":"1679_CR17","doi-asserted-by":"publisher","first-page":"2900","DOI":"10.1109\/TPAMI.2023.3334614","volume":"46","author":"Y He","year":"2023","unstructured":"He Y, Xiao L (2023) Structured pruning for deep convolutional neural networks: a survey. IEEE Trans Pattern Anal Mach Intell 46(5):2900\u20132919","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1679_CR18","unstructured":"Dong X, Chen S, Pan S (2017) Learning to prune deep neural networks via layer-wise optimal brain surgeon. In: Advances in neural information processing systems, vol 30"},{"key":"1679_CR19","doi-asserted-by":"crossref","unstructured":"Yu R, Li A, Chen C-F, Lai J-H, Morariu VI, Han X, Gao M, Lin C-Y, Davis LS (2018) NISP: pruning networks using neuron importance score propagation. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 9194\u20139203","DOI":"10.1109\/CVPR.2018.00958"},{"key":"1679_CR20","unstructured":"Salama A, Ostapenko O, Klein T, Nabi M (2019) Pruning at a glance: global neural pruning for model compression. arXiv preprint arXiv:1912.00200"},{"key":"1679_CR21","doi-asserted-by":"crossref","unstructured":"Lin S, Ji R, Li Y, Wu Y, Huang F, Zhang B (2018) Accelerating convolutional networks via global & dynamic filter pruning. In: IJCAI, Stockholm, vol 2, p 8","DOI":"10.24963\/ijcai.2018\/336"},{"key":"1679_CR22","doi-asserted-by":"crossref","unstructured":"Xi Z, Zheng R, Gui T, Zhang Q, Huang X-J (2022) Efficient adversarial training with robust early-bird tickets. In: Proceedings of the 2022 conference on empirical methods in natural language processing, pp 8318\u20138331","DOI":"10.18653\/v1\/2022.emnlp-main.569"},{"key":"1679_CR23","unstructured":"Tan CMJ, Motani M (2020) DropNet: reducing neural network complexity via iterative pruning. In: International conference on machine learning. PMLR, pp 9356\u20139366"},{"key":"1679_CR24","unstructured":"Mikler S (2021) Reproducibility study: comparing rewinding and fine-tuning in neural network pruning. arXiv preprint arXiv:2109.09670"},{"key":"1679_CR25","unstructured":"Liu, S., Ghosh, R., Min, J.T.C., Motani, M.: Optimizing learning rate schedules for iterative pruning of deep neural networks. arXiv preprint arXiv:2212.06144 (2022)"},{"key":"1679_CR26","unstructured":"Hu H, Peng R, Tai Y-W, Tang C-K (2016) Network trimming: a data-driven neuron pruning approach towards efficient deep architectures. arXiv preprint arXiv:1607.03250"},{"key":"1679_CR27","unstructured":"Lee N, Ajanthan T, Torr P (2019) SNIP: single-shot network pruning based on connection sensitivity. In: International conference on learning representations. Open Review"},{"key":"1679_CR28","first-page":"129","volume":"2","author":"D Blalock","year":"2020","unstructured":"Blalock D, Gonzalez Ortiz JJ, Frankle J, Guttag J (2020) What is the state of neural network pruning? Proc Mach Learn Syst 2:129\u2013146","journal-title":"Proc Mach Learn Syst"},{"key":"1679_CR29","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.neunet.2021.07.001","volume":"143","author":"C Chatzikonstantinou","year":"2021","unstructured":"Chatzikonstantinou C, Konstantinidis D, Dimitropoulos K, Daras P (2021) Recurrent neural network pruning using dynamical systems and iterative fine-tuning. Neural Netw 143:475\u2013488","journal-title":"Neural Netw"},{"key":"1679_CR30","unstructured":"Chen W, Wilson J, Tyree S, Weinberger K, Chen Y (2015) Compressing neural networks with the hashing trick. In: International conference on machine learning. PMLR, pp 2285\u20132294"},{"key":"1679_CR31","doi-asserted-by":"crossref","unstructured":"Luo J-H, Wu J, Lin W (2017) ThiNet: a filter level pruning method for deep neural network compression. In: Proceedings of the IEEE international conference on computer vision, pp 5058\u20135066","DOI":"10.1109\/ICCV.2017.541"},{"key":"1679_CR32","doi-asserted-by":"crossref","unstructured":"He Y, Kang G, Dong X, Fu Y, Yang Y (2018) Soft filter pruning for accelerating deep convolutional neural networks. In: Proceedings of the 27th International joint conference on artificial intelligence, pp 2234\u20132240","DOI":"10.24963\/ijcai.2018\/309"},{"key":"1679_CR33","doi-asserted-by":"crossref","unstructured":"Bai S, Chen J, Shen X, Qian Y, Liu Y (2023) Unified data-free compression: pruning and quantization without fine-tuning. In: Proceedings of the IEEE\/CVF international conference on computer vision, pp 5876\u20135885","DOI":"10.1109\/ICCV51070.2023.00540"},{"key":"1679_CR34","doi-asserted-by":"crossref","unstructured":"Jiang T, Wang D, Zhuang F, Xie R, Xia F (2022) Pruning pre-trained language models without fine-tuning. arXiv preprint arXiv:2210.06210","DOI":"10.18653\/v1\/2023.acl-long.35"},{"key":"1679_CR35","doi-asserted-by":"crossref","unstructured":"Mallya A, Lazebnik S (2018) PackNet: adding multiple tasks to a single network by iterative pruning. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 7765\u20137773","DOI":"10.1109\/CVPR.2018.00810"},{"issue":"1","key":"1679_CR36","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1146\/annurev.ne.18.030195.001205","volume":"18","author":"R Desimone","year":"1995","unstructured":"Desimone R, Duncan J (1995) Neural mechanisms of selective visual attention. Annu Rev Neurosci 18(1):193\u2013222","journal-title":"Annu Rev Neurosci"},{"key":"1679_CR37","doi-asserted-by":"crossref","unstructured":"Liu N, Han J, Zhang D, Wen S, Liu T (2015) Predicting eye fixations using convolutional neural networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 362\u2013370","DOI":"10.1109\/CVPR.2015.7298633"},{"key":"1679_CR38","doi-asserted-by":"crossref","unstructured":"Huang X, Shen C, Boix X, Zhao Q (2015) SALICON: reducing the semantic gap in saliency prediction by adapting deep neural networks. In: Proceedings of the IEEE international conference on computer vision, pp 262\u2013270","DOI":"10.1109\/ICCV.2015.38"},{"issue":"5","key":"1679_CR39","doi-asserted-by":"publisher","first-page":"2368","DOI":"10.1109\/TIP.2017.2787612","volume":"27","author":"W Wang","year":"2017","unstructured":"Wang W, Shen J (2017) Deep visual attention prediction. IEEE Trans Image Process 27(5):2368\u20132378","journal-title":"IEEE Trans Image Process"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-026-01679-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-026-01679-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-026-01679-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T05:36:39Z","timestamp":1777700199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-026-01679-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,2]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1679"],"URL":"https:\/\/doi.org\/10.1007\/s10044-026-01679-y","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,2]]},"assertion":[{"value":"8 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This research did not involve human participants or animals and therefore did not require ethics committee approval.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"95"}}