{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:57:52Z","timestamp":1767992272157,"version":"3.49.0"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003725","name":"Basic Science Research Program through the National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT & Future Planning","doi-asserted-by":"publisher","award":["2018R1C1B3008159"],"award-info":[{"award-number":["2018R1C1B3008159"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3131310","type":"journal-article","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T23:36:50Z","timestamp":1638315410000},"page":"165005-165013","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic Structured Pruning With Novel Filter Importance and Leaky Masking Based on Convolution and Batch Normalization Parameters"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5641-5596","authenticated-orcid":false,"given":"Incheon","family":"Cho","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Kyung Hee University, Yongin-si, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7440-5532","authenticated-orcid":false,"given":"Eunseop","family":"Shin","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Kyung Hee University, Yongin-si, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8548-3827","authenticated-orcid":false,"given":"Muhammad Salman","family":"Ali","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Kyung Hee University, Yongin-si, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2677-3186","authenticated-orcid":false,"given":"Sung-Ho","family":"Bae","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Kyung Hee University, Yongin-si, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00079"},{"key":"ref33","article-title":"Categorical reparameterization with Gumbel–Softmax","author":"jang","year":"2016","journal-title":"arXiv 1611 01144"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2933477"},{"key":"ref31","first-page":"2943","article-title":"Rigging the lottery: Making all tickets winners","author":"evci","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","article-title":"Global sparse momentum SGD for pruning very deep neural networks","author":"ding","year":"2019","journal-title":"arXiv 1909 12778"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR48806.2021.9412993"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371849"},{"key":"ref35","article-title":"Estimating or propagating gradients through stochastic neurons for conditional computation","author":"bengio","year":"2013","journal-title":"arXiv 1308 3432"},{"key":"ref34","author":"boyd","year":"2011","journal-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers"},{"key":"ref28","first-page":"1387","article-title":"Dynamic network surgery for efficient DNNs","author":"guo","year":"2016","journal-title":"Proc NIPS"},{"key":"ref27","article-title":"PruneNet: Channel pruning via global importance","author":"khetan","year":"2020","journal-title":"arXiv 2005 11282"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3394885.3431542"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"ref20","article-title":"Dynamic sparse training: Find efficient sparse network from scratch with trainable masked layers","author":"liu","year":"2020","journal-title":"arXiv 2005 06870"},{"key":"ref22","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","volume":"28","author":"han","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","first-page":"1","article-title":"Deep compression: Compressing deep neural network with pruning, trained quantization and Huffman coding","author":"han","year":"2016","journal-title":"Proc 4th Int Conf Learn Represent (ICLR)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3013050"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00290"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.298"},{"key":"ref25","first-page":"2133","article-title":"Gate decorator: Global filter pruning method for accelerating deep convolutional neural networks","author":"you","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref50","article-title":"Learning multiple layers of features from tiny images","author":"krizhevsky","year":"2009"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3026784"},{"key":"ref56","article-title":"Weighted-SVD: Matrix factorization with weights on the latent factors","author":"chen","year":"2017","journal-title":"arXiv 1710 00482"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.155"},{"key":"ref54","first-page":"5863","article-title":"Penni: Pruned kernel sharing for efficient CNN inference","author":"li","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref53","article-title":"Accurate, large minibatch SGD: Training ImageNet in 1 hour","author":"goyal","year":"2017","journal-title":"arXiv 1706 02677"},{"key":"ref52","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate O (1\/k²)","volume":"269","author":"nesterov","year":"1983","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref10","article-title":"Learned step size quantization","author":"esser","year":"2019","journal-title":"arXiv 1902 08153"},{"key":"ref11","article-title":"Distilling the knowledge in a neural network","author":"hinton","year":"2015","journal-title":"ArXiv 1503 02531"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/309"},{"key":"ref12","article-title":"ACDC: Weight sharing in atom-coefficient decomposed convolution","author":"wang","year":"2020","journal-title":"arXiv 2009 02386"},{"key":"ref13","first-page":"2","article-title":"Speeding-up convolutional neural networks using fine-tuned CP-decomposition","author":"lebedev","year":"2015","journal-title":"Proc 3rd Int Conf Learn Represent (ICLR) Conf Track"},{"key":"ref14","article-title":"Faster CNNs with direct sparse convolutions and guided pruning","author":"park","year":"2016","journal-title":"arXiv 1608 01409"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3007787.3001163"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/336"},{"key":"ref17","first-page":"5122","article-title":"Operation-aware soft channel pruning using differentiable masks","author":"kang","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref18","first-page":"5544","article-title":"Soft threshold weight reparameterization for learnable sparsity","author":"kusupati","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","first-page":"1","article-title":"Dynamic model pruning with feedback","author":"lin","year":"2019","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.81"},{"key":"ref3","article-title":"MobileNets: Efficient convolutional neural networks for mobile vision applications","author":"howard","year":"2017","journal-title":"arXiv 1704 04861"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298965"},{"key":"ref5","first-page":"91","article-title":"Faster R-CNN: Towards real-time object detection with region proposal networks","author":"ren","year":"2015","journal-title":"Proc NIPS"},{"key":"ref8","article-title":"Pruning filters for efficient ConvNets","author":"li","year":"2016","journal-title":"arXiv 1608 08710"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699184"},{"key":"ref49","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.1109\/CVPR.2019.00447"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58598-3_36"},{"key":"ref45","first-page":"5553","article-title":"Structured convolutions for efficient neural network design","volume":"33","author":"bhalgat","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref48","first-page":"1","article-title":"Rethinking the smaller-norm-less-informative assumption in channel pruning of convolution layers","author":"ye","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00804"},{"key":"ref42","first-page":"1","article-title":"Young’s convolution Inequalities for weighted mixed (quasi-) norm spaces","volume":"5","author":"galperin","year":"2014","journal-title":"J Inequal Special Functions"},{"key":"ref41","first-page":"53","article-title":"On n-inner products, n-norms, and the Cauchy–Schwarz inequality","volume":"55","author":"gunawan","year":"2002","journal-title":"Scientiae Mathematicae Japonicae"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58536-5_38"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00153"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09627979.pdf?arnumber=9627979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:28:33Z","timestamp":1662668913000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9627979\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3131310","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}