{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:10:27Z","timestamp":1753884627524,"version":"3.41.2"},"reference-count":15,"publisher":"World Scientific Pub Co Pte Ltd","issue":"12","funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61976098"],"award-info":[{"award-number":["61976098"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science and Technology Development Foundation of Quanzhou City","award":["2020C067"],"award-info":[{"award-number":["2020C067"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2022,9,30]]},"abstract":"<jats:p> Model pruning is one of the main methods of deep neural network model compression. However, the existing model pruning methods are inefficient, there is still a lot of redundancy in the network, and the pruning has a great impact on the accuracy. In addition, the traditional pruning process usually needs to fine-tune the network to restore accuracy, and fine-tuning has a limited effect on accuracy recovery, so it is difficult to achieve a high level of accuracy. In this paper, we propose a new neural network pruning framework: the channel sparsity is realized by introducing a scale factor, and the sparse network is pruned by setting a global threshold, which greatly improves the efficiency of pruning. After pruning, this paper proposes a rewind method to restore the accuracy, that is, save the weight after training, and then reload it on the network for training to restore the accuracy. In addition, we also study the best rewind point of the three networks. The experimental results show that our method significantly reduces the number of parameters and FLOPs without affecting or even improving the accuracy, and the rewind method proposed by us achieves a better accuracy recovery effect than fine-tuning. At the same time, we find that the epoch with the highest accuracy is the best rewind point, and the accuracy is the highest after saving its corresponding weight and retraining the model. <\/jats:p>","DOI":"10.1142\/s0218001422590285","type":"journal-article","created":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T06:47:26Z","timestamp":1656658046000},"source":"Crossref","is-referenced-by-count":0,"title":["A New Network Pruning Framework Based on Rewind"],"prefix":"10.1142","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3344-7066","authenticated-orcid":false,"given":"Haoran","family":"Yu","sequence":"first","affiliation":[{"name":"College of Information Science and Engineering, HuaQiao University, Fujian, QuanZhou 362000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7285-8714","authenticated-orcid":false,"given":"Weiwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Engineering, HuaQiao University, Fujian, QuanZhou 362000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongbo","family":"Zhou","sequence":"additional","affiliation":[{"name":"College of Engineering, HuaQiao University, Fujian, QuanZhou 362000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Ma","sequence":"additional","affiliation":[{"name":"College of Engineering, HuaQiao University, Fujian, QuanZhou 362000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2022,8,26]]},"reference":[{"key":"S0218001422590285BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.01.053"},{"key":"S0218001422590285BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.81"},{"key":"S0218001422590285BIB008","first-page":"1319","volume":"28","author":"Goodfellow I.","year":"2013","journal-title":"Proc. Mach. Learn. Res."},{"key":"S0218001422590285BIB010","first-page":"1135","volume-title":"Advances in Neural Information Processing Systems","volume":"28","author":"Han S.","year":"2015"},{"key":"S0218001422590285BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.123"},{"key":"S0218001422590285BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"S0218001422590285BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46493-0_38"},{"key":"S0218001422590285BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.243"},{"key":"S0218001422590285BIB018","first-page":"84","volume-title":"Advances in Neural Information Processing Systems 25","author":"Krizhevsky A.","year":"2012"},{"key":"S0218001422590285BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.298"},{"key":"S0218001422590285BIB022","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46493-0_32"},{"volume-title":"Int. Conf. Learning Representation","year":"2020","author":"Renda A.","key":"S0218001422590285BIB023"},{"key":"S0218001422590285BIB025","first-page":"1139","volume":"28","author":"Sutskever I.","year":"2013","journal-title":"Proc. Mach. Learn. Res."},{"key":"S0218001422590285BIB028","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46493-0_40"},{"key":"S0218001422590285BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.10.009"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001422590285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T10:17:39Z","timestamp":1666001859000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218001422590285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,26]]},"references-count":15,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,9,30]]}},"alternative-id":["10.1142\/S0218001422590285"],"URL":"https:\/\/doi.org\/10.1142\/s0218001422590285","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"type":"print","value":"0218-0014"},{"type":"electronic","value":"1793-6381"}],"subject":[],"published":{"date-parts":[[2022,8,26]]},"article-number":"2259028"}}