{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T13:45:33Z","timestamp":1770731133744,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2022MF260"],"award-info":[{"award-number":["ZR2022MF260"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673396"],"award-info":[{"award-number":["61673396"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07786-7","type":"journal-article","created":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T18:54:39Z","timestamp":1756320879000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["LSA-MEP: layer-wise sparsity allocation multi-metric evaluation pruning"],"prefix":"10.1007","volume":"81","author":[{"given":"Hong","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quanyi","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingwen","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"key":"7786_CR1","first-page":"1877","volume":"33","author":"T Brown","year":"2020","unstructured":"Brown T, Mann B, Ryder N, Subbiah M, Kaplan JD, Dhariwal P, Neelakantan A, Shyam P, Sastry G, Askell A et al (2020) Language models are few-shot learners. Adv Neural Inf Process Syst 33:1877\u20131901","journal-title":"Adv Neural Inf Process Syst"},{"key":"7786_CR2","unstructured":"Radford A, Kim JW, Hallacy C, Ramesh A, Goh G, Agarwal S, Sastry G, Askell A, Mishkin P, Clark J, et al (2021) Learning transferable visual models from natural language supervision. In: International Conference on Machine Learning, pp. 8748\u20138763. PMLR"},{"key":"7786_CR3","doi-asserted-by":"crossref","unstructured":"Kirillov A, Mintun E, Ravi N, Mao H, Rolland C, Gustafson L, Xiao T, Whitehead S, Berg AC, Lo W-Y et al (2023) Segment anything. 2023 ieee. In: CVF International Conference on Computer Vision (ICCV), vol. 1","DOI":"10.1109\/ICCV51070.2023.00371"},{"key":"7786_CR4","doi-asserted-by":"crossref","unstructured":"Bender EM, Gebru T, McMillan-Major A, Shmitchell S (2021) On the dangers of stochastic parrots: Can language models be too big? In: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, pp. 610\u2013623","DOI":"10.1145\/3442188.3445922"},{"key":"7786_CR5","first-page":"13693","volume":"34","author":"E Strubell","year":"2020","unstructured":"Strubell E, Ganesh A, McCallum A (2020) Energy and policy considerations for modern deep learning research. Proc AAAI Conf AI 34:13693\u201313696","journal-title":"Proc AAAI Conf AI"},{"issue":"12","key":"7786_CR6","doi-asserted-by":"publisher","first-page":"13766","DOI":"10.1007\/s11227-023-05202-6","volume":"79","author":"D Guam\u00e1n","year":"2023","unstructured":"Guam\u00e1n D, P\u00e9rez J, Valdiviezo-Diaz P (2023) Estimating the energy consumption of model-view-controller applications. J Supercomput 79(12):13766\u201313793","journal-title":"J Supercomput"},{"issue":"14","key":"7786_CR7","doi-asserted-by":"publisher","first-page":"15820","DOI":"10.1007\/s11227-022-04515-2","volume":"78","author":"L Souza","year":"2022","unstructured":"Souza L, Camboim K, Alencar F (2022) A systematic literature review about integrating dependability attributes, performability and sustainability in the implantation of cooling subsystems in data center. J Supercomput 78(14):15820\u201315856","journal-title":"J Supercomput"},{"issue":"2","key":"7786_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1504\/IJCAST.2024.143881","volume":"1","author":"Y Li","year":"2024","unstructured":"Li Y, Yang Z, Zheng H, Zhang X (2024) A hybrid lstm-snn approach for robust multimodal zero-shot learning. Int J Complexity Appl Sci Technol 1(2):195\u2013209","journal-title":"Int J Complexity Appl Sci Technol"},{"issue":"2","key":"7786_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1504\/IJCAST.2024.143882","volume":"1","author":"BO Togay","year":"2024","unstructured":"Togay BO, Firat C (2024) Comprehensive faults analysis on the direct current side of photovoltaic systems using logistic model tree algorithm. Int J Complex Appl Sci Technol 1(2):177\u2013194","journal-title":"Int J Complex Appl Sci Technol"},{"issue":"2","key":"7786_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1504\/IJCAST.2024.143880","volume":"1","author":"V Sammartino","year":"2024","unstructured":"Sammartino V (2024) A comparative study of machine learning models for hate speech and stereotype detection in italian texts. Int J Complex Appl Sci Technol 1(2):155\u2013176","journal-title":"Int J Complex Appl Sci Technol"},{"issue":"3","key":"7786_CR11","first-page":"281","volume":"1","author":"E Oncu","year":"2025","unstructured":"Oncu E (2025) Integrating cnns and anns: a comprehensive ai framework for enhanced breast cancer detection and diagnosis. Int J Complex Appl Sci Technol 1(3):281\u2013299","journal-title":"Int J Complex Appl Sci Technol"},{"issue":"3","key":"7786_CR12","first-page":"211","volume":"1","author":"J Lin","year":"2025","unstructured":"Lin J, Sun Y, Gao Y (2025) A solution to portfolio optimisation based on random forest and long short-term memory networks. Int J Complex Appl Sci Technol 1(3):211\u2013232","journal-title":"Int J Complex Appl Sci Technol"},{"key":"7786_CR13","unstructured":"Kaplan J, McCandlish S, Henighan T, Brown TB, Chess B, Child R, Gray S, Radford A, Wu J, Amodei D (2020) Scaling laws for neural language models. CoRR abs\/2001.08361. arXiv:2001.08361"},{"key":"7786_CR14","doi-asserted-by":"publisher","unstructured":"Luccioni AS, Hern\u00e1ndez-Garc\u00eda A (2023) Counting carbon: A survey of factors influencing the emissions of machine learning. CoRR abs\/2302.08476 https:\/\/doi.org\/10.48550\/ARXIV.2302.08476. arXiv:2302.08476","DOI":"10.48550\/ARXIV.2302.08476"},{"issue":"5","key":"7786_CR15","doi-asserted-by":"publisher","first-page":"5815","DOI":"10.1007\/s11227-023-05671-9","volume":"80","author":"P Li","year":"2024","unstructured":"Li P, Che C, Hou R (2024) Nacc-guard: a lightweight dnn accelerator architecture for secure deep learning. J Supercomput 80(5):5815\u20135831","journal-title":"J Supercomput"},{"issue":"15","key":"7786_CR16","doi-asserted-by":"publisher","first-page":"17445","DOI":"10.1007\/s11227-023-05339-4","volume":"79","author":"M Tang","year":"2023","unstructured":"Tang M, Russo E, Palesi M (2023) The position-based compression techniques for dnn model. J Supercomput 79(15):17445\u201317474","journal-title":"J Supercomput"},{"key":"7786_CR17","unstructured":"Frankle J, Carbin M (2019) The lottery ticket hypothesis: Finding sparse, trainable neural networks. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. https:\/\/openreview.net\/forum?id=rJl-b3RcF7"},{"key":"7786_CR18","unstructured":"Mostafa H, Wang X (2019) Parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization. In: International Conference on Machine Learning, pp. 4646\u20134655. PMLR"},{"key":"7786_CR19","unstructured":"Louizos C, Welling M, Kingma DP (2018) Learning sparse neural networks through l_0 regularization. In: 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. https:\/\/openreview.net\/forum?id=H1Y8hhg0b"},{"key":"7786_CR20","unstructured":"Wang C, Grosse R, Fidler S, Zhang G (2019) Eigendamage: Structured pruning in the kronecker-factored eigenbasis. In: International Conference on Machine Learning, pp. 6566\u20136575. PMLR"},{"issue":"18","key":"7786_CR21","doi-asserted-by":"publisher","first-page":"21185","DOI":"10.1007\/s11227-023-05487-7","volume":"79","author":"S Ahmadluei","year":"2023","unstructured":"Ahmadluei S, Faez K, Masoumi B (2023) Convolutional neural network pruning based on misclassification cost. J Supercomput 79(18):21185\u201321234","journal-title":"J Supercomput"},{"key":"7786_CR22","unstructured":"Han S, Pool J, Tran J, Dally W (2015) Learning both weights and connections for efficient neural network. Advances in neural information processing systems 28"},{"key":"7786_CR23","unstructured":"Renda A, Frankle J, Carbin M (2020) Comparing rewinding and fine-tuning in neural network pruning. In: 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020. https:\/\/openreview.net\/forum?id=S1gSj0NKvB"},{"key":"7786_CR24","unstructured":"Lee N, Ajanthan T, Torr PHS (2019) Snip: single-shot network pruning based on connection sensitivity. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. https:\/\/openreview.net\/forum?id=B1VZqjAcYX"},{"key":"7786_CR25","unstructured":"Tanaka H, Kunin D, Yamins DLK, Ganguli S (2020) Pruning neural networks without any data by iteratively conserving synaptic flow. In: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, Virtual. https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/46a4378f835dc8040c8057beb6a2da52-Abstract.html"},{"key":"7786_CR26","unstructured":"Wang C, Zhang G, Grosse RB (2020) Picking winning tickets before training by preserving gradient flow. In: 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020. https:\/\/openreview.net\/forum?id=SkgsACVKPH"},{"key":"7786_CR27","unstructured":"Wang Y, Li D, Sun R (2023) NTK-SAP: improving neural network pruning by aligning training dynamics. In: The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023. https:\/\/openreview.net\/forum?id=-5EWhW_4qWP"},{"key":"7786_CR28","unstructured":"Molchanov P, Tyree S, Karras T, Aila T, Kautz J (2017) Pruning convolutional neural networks for resource efficient inference. In: 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings. https:\/\/openreview.net\/forum?id=SJGCiw5gl"},{"key":"7786_CR29","doi-asserted-by":"crossref","unstructured":"Tishby N, Zaslavsky N (2015) Deep learning and the information bottleneck principle. In: 2015 Ieee Information Theory Workshop (itw), pp. 1\u20135. IEEE","DOI":"10.1109\/ITW.2015.7133169"},{"key":"7786_CR30","unstructured":"Liu S, Chen T, Chen X, Shen L, Mocanu DC, Wang Z, Pechenizkiy M (2022) The unreasonable effectiveness of random pruning: Return of the most naive baseline for sparse training. In: The Tenth International Conference on Learning Representations, ICLR 2022, Virtual Event, April 25-29, 2022. https:\/\/openreview.net\/forum?id=VBZJ_3tz-t"},{"key":"7786_CR31","unstructured":"Hu H, Peng R, Tai Y, Tang C (2016) Network trimming: A data-driven neuron pruning approach towards efficient deep architectures. CoRR abs\/1607.03250. arXiv:1607.03250"},{"key":"7786_CR32","unstructured":"Luo J, Wu J (2017) An entropy-based pruning method for CNN compression. CoRR abs\/1706.05791. arXiv:1706.05791"},{"key":"7786_CR33","doi-asserted-by":"publisher","first-page":"2950","DOI":"10.1007\/s11227-018-2684-z","volume":"75","author":"C Hur","year":"2019","unstructured":"Hur C, Kang S (2019) Entropy-based pruning method for convolutional neural networks. J Supercomput 75:2950\u20132963","journal-title":"J Supercomput"},{"key":"7786_CR34","unstructured":"Lee W, Xiang D (2000) Information-theoretic measures for anomaly detection. In: Proceedings 2001 IEEE Symposium on Security and Privacy. S &P 2001, pp. 130\u2013143. IEEE"},{"key":"7786_CR35","unstructured":"Tishby N, Pereira FC, Bialek W (2000) The information bottleneck method. https:\/\/arxiv.org\/abs\/physics\/0004057"},{"issue":"12","key":"7786_CR36","doi-asserted-by":"publisher","first-page":"6600","DOI":"10.1103\/PhysRevA.39.6600","volume":"39","author":"SA Janowsky","year":"1989","unstructured":"Janowsky SA (1989) Pruning versus clipping in neural networks. Phys Rev A 39(12):6600","journal-title":"Phys Rev A"},{"issue":"1","key":"7786_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/09540098908915626","volume":"1","author":"MC Mozer","year":"1989","unstructured":"Mozer MC, Smolensky P (1989) Using relevance to reduce network size automatically. Connect Sci 1(1):3\u201316","journal-title":"Connect Sci"},{"key":"7786_CR38","unstructured":"LeCun Y, Denker J, Solla S (1989) Optimal brain damage. Advances in neural information processing systems 2"},{"key":"7786_CR39","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":"7786_CR40","unstructured":"Verma S, Pesquet J-C (2021) Sparsifying networks via subdifferential inclusion. In: International Conference on Machine Learning, pp. 10542\u201310552. PMLR"},{"key":"7786_CR41","unstructured":"Jorge P, Sanyal A, Behl HS, Torr PHS, Rogez G, Dokania PK (2021) Progressive skeletonization: Trimming more fat from a network at initialization. In: 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3-7, 2021. https:\/\/openreview.net\/forum?id=9GsFOUyUPi"},{"key":"7786_CR42","unstructured":"Verdenius S, Stol M, Forr\u00e9 P (2020) Pruning via iterative ranking of sensitivity statistics. CoRR abs\/2006.00896. arXiv:2006.00896"},{"key":"7786_CR43","unstructured":"Alizadeh M, Tailor SA, Zintgraf LM, Amersfoort J, Farquhar S, Lane ND, Gal Y (2022) Prospect pruning: Finding trainable weights at initialization using meta-gradients. In: The Tenth International Conference on Learning Representations, ICLR 2022, Virtual Event, April 25-29, 2022. https:\/\/openreview.net\/forum?id=AIgn9uwfcD1"},{"key":"7786_CR44","unstructured":"Ruder S (2016) An overview of gradient descent optimization algorithms. CoRR abs\/1609.04747. arXiv:1609.04747"},{"key":"7786_CR45","unstructured":"Kingma DP, Ba J (2015) Adam: A method for stochastic optimization. In: 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings. http:\/\/arxiv.org\/abs\/1412.6980"},{"key":"7786_CR46","unstructured":"Evci U, Gale T, Menick J, Castro PS, Elsen E (2020) Rigging the lottery: Making all tickets winners. In: International Conference on Machine Learning, pp. 2943\u20132952. PMLR"},{"key":"7786_CR47","doi-asserted-by":"publisher","unstructured":"Srinivas S, Babu RV (2015) Data-free parameter pruning for deep neural networks. In: Xie, X., Jones MW, Tam, G.K.L. (eds.) Proceedings of the British Machine Vision Conference 2015, BMVC 2015, Swansea, UK, September 7-10, 2015, pp. 31\u201313112. https:\/\/doi.org\/10.5244\/C.29.31","DOI":"10.5244\/C.29.31"},{"key":"7786_CR48","unstructured":"Frankle J, Dziugaite GK, Roy D, Carbin, M (2020) Linear mode connectivity and the lottery ticket hypothesis. In: International Conference on Machine Learning, pp. 3259\u20133269. PMLR"},{"key":"7786_CR49","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J (2016) Deep residual learning for image recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 770\u2013778","DOI":"10.1109\/CVPR.2016.90"},{"key":"7786_CR50","unstructured":"Krizhevsky A, Hinton G, et\u00a0al (2009) Learning multiple layers of features from tiny images"},{"key":"7786_CR51","unstructured":"Simonyan K, Zisserman, A (2015) Very deep convolutional networks for large-scale image recognition. In: Bengio, Y., LeCun, Y. (eds.) 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings"},{"key":"7786_CR52","doi-asserted-by":"crossref","unstructured":"Deng J, Dong W, Socher R, Li L-J, Li K, Fei-Fei L (2009) Imagenet: A large-scale hierarchical image database. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition, pp. 248\u2013255. Ieee","DOI":"10.1109\/CVPR.2009.5206848"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07786-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07786-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07786-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:53:19Z","timestamp":1757479999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07786-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"references-count":52,"journal-issue":{"issue":"13","published-online":{"date-parts":[[2025,8]]}},"alternative-id":["7786"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07786-7","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,27]]},"assertion":[{"value":"17 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2025","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":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"1279"}}