{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T13:39:46Z","timestamp":1768484386847,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Shandong Provintial Natural Science Foundation","award":["No. ZR2020QF114"],"award-info":[{"award-number":["No. ZR2020QF114"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Pruning is effective to reduce neural networks\u2019 parameters and accelerate inferences, facilitating deep learning in resource-limited scenarios. This paper proposes an asynchronous pruning method for multi-branch networks on the basis of our previous work on channel coresets constructions, to achieve module-level pruning. Firstly, this paper accelerates coreset based pruning by batch sampling with a sampling probability decided on our-designed importance function. Secondly, this paper gives asynchronous pruning solutions with an in-place distillation of feature maps for deployment on multi-branch networks such as ResNet and SqueezeNet. Thirdly, this paper provides an extension to neuron pruning by grouping weights as channels. During tests on sensitivity of different layers to channel pruning, our method outperforms comparison schemes on object detection networks, indicating advantages of data-independent channel selections in maintaining precision. As shown in tests of asynchronous pruning solutions on multi-branch classification networks, our method further decreases FLOPs with a small accuracy decline on ResNet and acquires a small accuracy increment on SqueezeNet. In tests on neuron pruning, our method achieves an accuracy comparable to existing coreset based pruning methods by two solutions of precision recovery.<\/jats:p>","DOI":"10.1007\/s10489-022-04092-0","type":"journal-article","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T08:02:46Z","timestamp":1664265766000},"page":"12387-12398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Coresets based asynchronous network slimming"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2033-8506","authenticated-orcid":false,"given":"Wenfeng","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaqian","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rengang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,27]]},"reference":[{"key":"4092_CR1","unstructured":"Arora S, Ge R, Neyshabur B et al (2018) Stronger generalization bounds for deep nets via a compression approach. In: Proceedings of the 35th international conference on machine learning. Stockholm, Sweden, 10\u201315 July 2018"},{"key":"4092_CR2","unstructured":"Baykal C, Liebenwein L, Gilitschenski I et al (2019) Data-dependent coresets for compressing neural networks with applications to generalization bounds. In: Proceedings of the international conference on learning representations, New Orleans, 6\u20139 May 2019"},{"key":"4092_CR3","unstructured":"Braverman V, Feldman D, Lang H et al (2016) New frameworks for offline and streaming coreset constructions. arXiv:16120.0889v2"},{"key":"4092_CR4","unstructured":"Denton EL, Zaremba W, Bruna J et al (2014) Exploiting linear structure within convolutional networks for efficient evaluation. In: Advances in neural information processing systems, pp 1269\u20131277"},{"key":"4092_CR5","doi-asserted-by":"crossref","unstructured":"Dubey A, Chatterjee M, Ahuja N (2018) Coreset-based neural network compression. In: Proceedings of the 15th European conference on computer vision, Munich. 8\u201314 September, 2018","DOI":"10.1007\/978-3-030-01234-2_28"},{"key":"4092_CR6","doi-asserted-by":"crossref","unstructured":"Feldman D, Langberg M (2011) A unified framework for approximating and clustering data. In: Proceedings of the 43th annual ACM symposium on theory of computing. New York, 2011, pp 569\u2013578","DOI":"10.1145\/1993636.1993712"},{"key":"4092_CR7","doi-asserted-by":"crossref","unstructured":"Gou JP, Yu BS, Maybank SJ et al (2021) Knowledge distillation: a survey. Int J Comput Vis:1\u201331","DOI":"10.1007\/s11263-021-01453-z"},{"key":"4092_CR8","unstructured":"Han S, Mao H, Dally WJ (2016) Deep compression: compressing deep neural networks with pruning, trained quantization and huffman coding. In: Proceedings of the international conference on learning representations. Puerto Rico, 2\u20134 May, 2016"},{"key":"4092_CR9","doi-asserted-by":"crossref","unstructured":"He Y, Lin J, Liu Z et al (2018) Amc: automl for model compression and acceleration on mobile devices. In: Proceedings of the 15th European conference on computer vision, Munich. 8\u201314 September, 2018","DOI":"10.1007\/978-3-030-01234-2_48"},{"key":"4092_CR10","doi-asserted-by":"crossref","unstructured":"He Y, Liu P, Wang Z et al (2019) Filter pruning via geometric median for deep convolutional neural networks acceleration. Proc IEEE Conf Comput Vis Pattern: 4340\u20134349","DOI":"10.1109\/CVPR.2019.00447"},{"key":"4092_CR11","doi-asserted-by":"crossref","unstructured":"He YH, Zhang XY, Sun J (2017) Channel pruning for accelerating very deep neural networks. In: Proceedings of the IEEE international conference on computer vision. Venice, 22\u201329 October,2017","DOI":"10.1109\/ICCV.2017.155"},{"key":"4092_CR12","unstructured":"Hinton G, Vinyals O, Dean J (2014) Distilling the knowledge in a neural network. In: Advances in neural information processing systems, pp \u20139"},{"key":"4092_CR13","unstructured":"Hooker S, Courville A, Dauphin Y et al (2020) What does a pruned deep neural network forgets? Bridging AI and cognitive science ICLR workshop:2020"},{"key":"4092_CR14","doi-asserted-by":"publisher","first-page":"16,197","DOI":"10.1007\/s00521-021-06222-0","volume":"33","author":"LZ Ji","year":"2021","unstructured":"Ji LZ, Zhang JS, Zhang CX et al (2021) Condensenet with exclusive lasso regularization. Neural Comput Appl 33:16,197\u201316,212","journal-title":"Neural Comput Appl"},{"key":"4092_CR15","unstructured":"Jiang ZY, Chen TL, Mortazavi B et al (2021) Self-damaging contrastive learning. In: Proceedings of the 38th international conference on machine learning. PMLR, vol 139, 2021"},{"key":"4092_CR16","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1007\/s10489-020-01894-y","volume":"51","author":"A Kumar","year":"2021","unstructured":"Kumar A, Shaikh AM, Li Y et al (2021) Pruning filters with l1-norm and capped l1-norm for cnn compression. Appl Intell 51:1152\u20131160","journal-title":"Appl Intell"},{"key":"4092_CR17","unstructured":"Li H, Kadav A, Durdanovic I et al (2017) Pruning filters for efficient convnets. In: Proceedings of the 5th International conference on learning representations, Toulon, 24\u201326 April, 2017"},{"key":"4092_CR18","doi-asserted-by":"crossref","unstructured":"Lin M, Ji R, Li S et al (2021) Filter sketch for network pruning. IEEE Trans Neural Netw Learn Syst:1\u201310","DOI":"10.1109\/TNNLS.2022.3156047"},{"key":"4092_CR19","doi-asserted-by":"crossref","unstructured":"Liu Z, Li J, Shen Z et al (2017) Learning efficient convolutional networks through network slimming. In: Proceedings of the ieee international conference on computer vision. Venice, 22-29 October, 2017, pp 2736\u20132744","DOI":"10.1109\/ICCV.2017.298"},{"key":"4092_CR20","unstructured":"Luo JH, Wu J (2021) Dual discriminator adversarial distillation for data-free model compression. Int J Mach Learn Cybern: 1\u201327"},{"key":"4092_CR21","doi-asserted-by":"crossref","unstructured":"Luo JH, Wu JX, Lin WY (2017) Thinet: a filter level pruning method for deep neural network compression. In: Proceedings of the IEEE international conference on computer visio. Venice, 22\u201329, October, 2017","DOI":"10.1109\/ICCV.2017.541"},{"key":"4092_CR22","unstructured":"Molchanov P, Tyree S, Karras T et al (2017) Pruning convolutional neural networks for resource efficient inference. In: Proceedings of the international conference on learning representations, Toulon, 24\u201326 April 2017"},{"key":"4092_CR23","unstructured":"Mussay B, Osadchy M, Braverman V et al (2020) Data-independent neural pruning via coresets. In: Proceedings of the international conference on learning representations. Addis Ababa, 26\u201330 April, 2020"},{"key":"4092_CR24","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1007\/s10489-020-01858-2","volume":"51","author":"OK Oyedotun","year":"2021","unstructured":"Oyedotun OK, Shabayek AER, Li Y et al (2021) Deep network compression with teacher latent subspace learning and lasso. Appl Intell 51:834\u2013853","journal-title":"Appl Intell"},{"key":"4092_CR25","doi-asserted-by":"publisher","first-page":"2163","DOI":"10.1109\/ACCESS.2015.2494536","volume":"3","author":"A Polyak","year":"2015","unstructured":"Polyak A, Wolf L (2015) Channel-level acceleration of deep face representations. IEEE Access 3:2163\u20132175","journal-title":"IEEE Access"},{"key":"4092_CR26","doi-asserted-by":"crossref","unstructured":"Radosavovic I, Dollar P, Girshick R et al (2018) Data distillation: towards omni-supervised learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition, Salt Lake City, 18\u201322 June 2018","DOI":"10.1109\/CVPR.2018.00433"},{"key":"4092_CR27","unstructured":"Romero A, Ballas N, Kahou SE et al (2015) Fitnets: hints for thin deep nets. In: Proceedings of the international conference on learning representations. San Diego, 7\u20139 May, 2015"},{"key":"4092_CR28","doi-asserted-by":"crossref","unstructured":"Srinivas S, Babu RV (2015) Data-free parameter pruning for deep neural networks. In: Proceedings of the british machine vision conference, September 2015, pp 31.1\u201331\u201312","DOI":"10.5244\/C.29.31"},{"key":"4092_CR29","doi-asserted-by":"crossref","unstructured":"Tung F, Mori G (2019) Similarity-preserving knowledge distillation. In: Proceedings of the IEEE international conference on computer vision, Seoul, South Korea, 27-3 October-November 2019","DOI":"10.1109\/ICCV.2019.00145"},{"key":"4092_CR30","unstructured":"Wang TZ, Zhu JY, Torralba A et al (2018) Dataset distillation. arXiv:1811.10959v3"},{"key":"4092_CR31","unstructured":"Wen W, Wu C, Wang Y et al (2016) Learning structured sparsity in deep neural networks. In: Advances in neural information processing systems, pp 2074\u20132082"},{"key":"4092_CR32","doi-asserted-by":"crossref","unstructured":"Yin W, Dong G, Zhao Y et al (2021) Coresets application in channel pruning for fast neural network slimming. In: Proceedings of the international joint conference on neural networks, Shenzhen, China, 18\u201322 July 2021","DOI":"10.1109\/IJCNN52387.2021.9533343"},{"key":"4092_CR33","doi-asserted-by":"crossref","unstructured":"Yu C, Wang J, Chen Y et al (2019a) Transfer channel pruning for compressing deep domain adaptation models. Int J Mach Learn Cybern:1\u201316","DOI":"10.1007\/s13042-019-01004-6"},{"key":"4092_CR34","unstructured":"Yu JH, Yang LJ, Xu N et al (2019b) Slimmable neural networks. In: Proceedings of the international conference on learning representations, New Orleans, United States, 6\u20139 May 2019"}],"updated-by":[{"DOI":"10.1007\/s10489-022-04318-1","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T00:00:00Z","timestamp":1670025600000}}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-04092-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-04092-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-04092-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T10:39:49Z","timestamp":1684579189000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-04092-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,27]]},"references-count":34,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["4092"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-04092-0","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10489-022-04318-1","asserted-by":"object"}]},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,27]]},"assertion":[{"value":"16 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2022","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10489-022-04318-1","URL":"https:\/\/doi.org\/10.1007\/s10489-022-04318-1","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}