{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:28:10Z","timestamp":1773142090208,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tpami.2022.3195774","type":"journal-article","created":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T21:57:38Z","timestamp":1659477458000},"page":"1-11","source":"Crossref","is-referenced-by-count":32,"title":["1xN Pattern for Pruning Convolutional Neural Networks"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1764-1894","authenticated-orcid":false,"given":"Mingbao","family":"Lin","sequence":"first","affiliation":[{"name":"Media Analytics and Computing Laboratory, Department of Artificial Intelligence, School of Informatics, Xiamen University, Xiamen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4409-7030","authenticated-orcid":false,"given":"Yuxin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Media Analytics and Computing Laboratory, Department of Artificial Intelligence, School of Informatics, Xiamen University, Xiamen, China"}]},{"given":"Yuchao","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Bohong","family":"Chen","sequence":"additional","affiliation":[{"name":"Media Analytics and Computing Laboratory, Department of Artificial Intelligence, School of Informatics, Xiamen University, Xiamen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6928-2638","authenticated-orcid":false,"given":"Fei","family":"Chao","sequence":"additional","affiliation":[{"name":"Media Analytics and Computing Laboratory, Department of Artificial Intelligence, School of Informatics, Xiamen University, Xiamen, China"}]},{"given":"Mengdi","family":"Wang","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Shen","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2978-5935","authenticated-orcid":false,"given":"Yonghong","family":"Tian","sequence":"additional","affiliation":[{"name":"School of Electronics Engineering and Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9163-2932","authenticated-orcid":false,"given":"Rongrong","family":"Ji","sequence":"additional","affiliation":[{"name":"Media Analytics and Computing Laboratory, Department of Artificial Intelligence, School of Informatics, Xiamen University, Xiamen, China"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1988","article-title":"Deep learning face representation by joint identification-verification","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Sun"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10362"},{"key":"ref4","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Han"},{"key":"ref5","first-page":"2943","article-title":"Rigging the lottery: Making all tickets winners","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Evci"},{"key":"ref6","article-title":"Pruning convolutional neural networks for resource efficient inference","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Molchanov"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2021.3061394"},{"key":"ref8","article-title":"Learning N:M fine-grained structured sparse neural networks from scratch","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Zhou"},{"key":"ref9","article-title":"Accelerated sparse neural training: A provable and efficient method to find N: M transposable masks","author":"Hubara","year":"2021"},{"key":"ref10","article-title":"Accelerating sparse deep neural networks","author":"Mishra","year":"2021"},{"key":"ref11","article-title":"Comparing rewinding and fine-tuning in neural network pruning","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Renda"},{"key":"ref12","article-title":"Pruning filters for efficient ConvNets","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00339"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00161"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref16","article-title":"Rethinking the value of network pruning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liu"},{"key":"ref17","article-title":"Network pruning that matters: A case study on retraining variants","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Le"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2017.241"},{"key":"ref19","first-page":"2684","article-title":"Discovering neural wirings","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wortsman"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00137"},{"key":"ref21","article-title":"MobileNets: Efficient convolutional neural networks for mobile vision applications","author":"Howard","year":"2017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00474"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00140"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref25","first-page":"598","article-title":"Optimal brain damage","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"LeCun"},{"key":"ref26","first-page":"164","article-title":"Second order derivatives for network pruning: Optimal brain surgeon","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hassibi"},{"key":"ref27","first-page":"4860","article-title":"Learning to prune deep neural networks via layer-wise optimal brain surgeon","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Dong"},{"key":"ref28","first-page":"1379","article-title":"Dynamic network surgery for efficient DNNs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Guo"},{"key":"ref29","article-title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Frankle"},{"key":"ref30","article-title":"Dynamic model pruning with feedback","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Lin"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/309"},{"key":"ref32","first-page":"1607","article-title":"Approximated oracle filter pruning for destructive CNN width optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ding"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/94"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01234-2_48"},{"key":"ref35","first-page":"2498","article-title":"Variational dropout sparsifies deep neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Molchanov"},{"key":"ref36","first-page":"316","article-title":"Channel permutations for N: M sparsity","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Pool"},{"key":"ref37","article-title":"Deep compression: Compressing deep neural networks with pruning, trained quantization and Huffman coding","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Han"},{"issue":"2","key":"ref38","first-page":"130","article-title":"Blocked-based sparse matrix-vector multiplication on distributed memory parallel computers","volume":"8","author":"Shahnaz","year":"2011","journal-title":"Int. Arab J. Inf. Technol."},{"key":"ref39","first-page":"578","article-title":"TVM: An automated end-to-end optimizing compiler for deep learning","volume-title":"Proc. Symp. Oper. Syst. Des. Implementation","author":"Chen"},{"key":"ref40","first-page":"863","article-title":"Ansor: Generating high-performance tensor programs for deep learning","volume-title":"Proc. Symp. Oper. Syst. Des. Implementation","author":"Zheng"},{"key":"ref42","first-page":"4115","article-title":"TETRIS: Tile-matching the tremendous irregular sparsity","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ji"},{"key":"ref43","article-title":"Block-sparse recurrent neural networks","author":"Narang","year":"2017"},{"key":"ref44","first-page":"2410","article-title":"Efficient neural audio synthesis","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kalchbrenner"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01464"},{"key":"ref46","article-title":"Hierarchical block sparse neural networks","author":"Vooturi","year":"2018"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/09847369.pdf?arnumber=9847369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T10:48:16Z","timestamp":1706784496000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9847369\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/tpami.2022.3195774","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}