{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T13:06:40Z","timestamp":1780319200530,"version":"3.54.1"},"reference-count":76,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62373324"],"award-info":[{"award-number":["62373324"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U24A20242"],"award-info":[{"award-number":["U24A20242"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62271448"],"award-info":[{"award-number":["62271448"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhejiang Province Leading Geese Plan","award":["2025C02160"],"award-info":[{"award-number":["2025C02160"]}]},{"name":"National Key Research and Development Program of China","award":["2024YFC3300092"],"award-info":[{"award-number":["2024YFC3300092"]}]},{"name":"Commercial Research Funds","award":["KYY-HX-20240822"],"award-info":[{"award-number":["KYY-HX-20240822"]}]},{"name":"Commercial Research Funds","award":["KYY-HX-20200650"],"award-info":[{"award-number":["KYY-HX-20200650"]}]},{"name":"Commercial Research Funds","award":["KYY-ZH-20240057"],"award-info":[{"award-number":["KYY-ZH-20240057"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Artif. Intell."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1109\/tai.2025.3544582","type":"journal-article","created":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T13:47:07Z","timestamp":1740404827000},"page":"2253-2265","source":"Crossref","is-referenced-by-count":2,"title":["Pruning Networks Only Using Few-Shot Pretraining Based on Gradient Similarity Frequency"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5863-8283","authenticated-orcid":false,"given":"Haigen","family":"Hu","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0214-3297","authenticated-orcid":false,"given":"Huihuang","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1322-7293","authenticated-orcid":false,"given":"Qianwei","family":"Zhou","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4664-3311","authenticated-orcid":false,"given":"Tieming","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Rethinking the value of network pruning","volume-title":"Proc. 7th ICLR","author":"Liu","year":"2019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i07.6910"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TG.2019.2896986"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106126"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-022-13428-4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2023.3294579"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3260903"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109508"},{"key":"ref9","article-title":"SNIP: Single-shot network pruning based on connection sensitivity","volume-title":"Proc. ICLR","author":"Lee","year":"2019"},{"key":"ref10","article-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","volume-title":"Proc. ICLR","author":"Frankle","year":"2019"},{"key":"ref11","article-title":"Drawing early-bird tickets: Toward more efficient training of deep networks","volume-title":"Proc. ICLR","author":"You","year":"2020"},{"key":"ref12","article-title":"Multi-prize lottery ticket hypothesis: Finding accurate binary neural networks by pruning a randomly weighted network","volume-title":"Proc. ICLR","author":"Diffenderfer","year":"2021"},{"key":"ref13","article-title":"A signal propagation perspective for pruning neural networks at initialization","volume-title":"Proc. ICLR","author":"Lee","year":"2020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-022-02064-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3275159"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3066410"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01600"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3086914"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.541"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.298"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00498"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01544"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2023.3337538"},{"key":"ref25","article-title":"Pruning deep neural networks from a sparsity perspective","volume-title":"Proc. 11th Int. Conf. Learn. Represent.","author":"Diao","year":"2023"},{"key":"ref26","article-title":"DFPC: Data flow driven pruning of coupled channels without data","volume-title":"Proc. 11th Int. Conf. Learn. Represent.","author":"Narshana","year":"2022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498425"},{"key":"ref28","first-page":"6377","article-title":"Pruning neural networks without any data by iteratively conserving synaptic flow","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Tanaka","year":"2020"},{"key":"ref29","article-title":"A gradient flow framework for analyzing network pruning","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Lubana","year":"2021"},{"key":"ref30","article-title":"Prospect pruning: Finding trainable weights at initialization using meta-gradients","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Alizadeh","year":"2022"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.123"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2885972"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3314820"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i4.28184"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58580-8_35"},{"key":"ref36","article-title":"Dual lottery ticket hypothesis","volume-title":"Proc. ICLR","author":"Bai","year":"2022"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/309"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/WACV57701.2024.00220"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00804"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00289"},{"key":"ref41","first-page":"9865","article-title":"Neuron-level structured pruning using polarization regularizer","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"33","author":"Zhuang","year":"2020"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2024.106577"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-023-05164-5"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121265"},{"key":"ref45","article-title":"Learning pruning-friendly networks via Frank-Wolfe: One-shot, any-sparsity, and no retraining","volume-title":"Proc. ICLR","author":"Miao","year":"2022"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2023.3248659"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00340"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3280899"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110229"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2023.3288986"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111978"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58598-3_36"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01555"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00915"},{"key":"ref55","first-page":"5122","article-title":"Operation-aware soft channel pruning using differentiable masks","volume-title":"Proc. ICML","author":"Kang","year":"2020"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00637"},{"key":"ref57","article-title":"SOSP: Efficiently capturing global correlations by second-order structured pruning","volume-title":"Proc. ICLR","author":"Nonnenmacher","year":"2022"},{"key":"ref58","first-page":"5113","article-title":"Collaborative channel pruning for deep networks","volume-title":"Proc. ICML","volume":"97","author":"Peng","year":"2019"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00208"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01601"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00290"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i1.19888"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01270-0_19"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.155"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00874"},{"key":"ref66","first-page":"20863","article-title":"Red: Looking for redundancies for data-free structured compression of deep neural networks","volume-title":"Proc. NeurIPS","author":"Yvinec","year":"2021"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/iccv.2019.00340"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107461"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2874634"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1145\/3520304.3528935"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03198-9"},{"key":"ref72","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Han","year":"2015"},{"key":"ref73","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume-title":"Proc. 13th Int. Conf. Artif. Intell. Statist.","author":"Glorot","year":"2010"},{"key":"ref74","article-title":"Exact solutions to the nonlinear dynamics of learning in deep linear neural networks","author":"Saxe","year":"2013"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2851-4"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"}],"container-title":["IEEE Transactions on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9078688\/11106307\/10902134.pdf?arnumber=10902134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T19:01:13Z","timestamp":1764270073000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10902134\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":76,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tai.2025.3544582","relation":{},"ISSN":["2691-4581"],"issn-type":[{"value":"2691-4581","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}