{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:58:23Z","timestamp":1742925503850,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819985487"},{"type":"electronic","value":"9789819985494"}],"license":[{"start":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T00:00:00Z","timestamp":1703462400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T00:00:00Z","timestamp":1703462400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-99-8549-4_12","type":"book-chapter","created":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T18:01:32Z","timestamp":1703440892000},"page":"137-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Channel Pruning for\u00a0Trainability Protection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9780-4352","authenticated-orcid":false,"given":"Jiaxin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dazong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenxing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,25]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Chen, J., Zhu, Z., Li, C., Zhao, Y.: Self-adaptive network pruning. In: International Conference on Neural Information Processing, pp. 175\u2013186 (2019)","DOI":"10.1007\/978-3-030-36708-4_15"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Elkerdawy, S., Elhoushi, M., Zhang, H., Ray, N.: Fire together wire together: a dynamic pruning approach with self-supervised mask prediction. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 12454\u201312463 (2022)","DOI":"10.1109\/CVPR52688.2022.01213"},{"key":"12_CR3","unstructured":"Gao, X., Zhao, Y., Dudziak, \u0141., Mullins, R., Xu, C.Z.: Dynamic channel pruning: feature boosting and suppression. arXiv preprint: arXiv:1810.05331 (2018)"},{"key":"12_CR4","unstructured":"Ge, Z., Liu, S., Wang, F., Li, Z., Sun, J.: YOLOX: exceeding yolo series in 2021. arXiv preprint: arXiv:2107.08430 (2021)"},{"key":"12_CR5","unstructured":"Han, S., Pool, J., Tran, J., Dally, W.: Learning both weights and connections for efficient neural network. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Las Vegas, NV, USA, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"He, Y., Kang, G., Dong, X., Fu, Y., Yang, Y.: Soft filter pruning for accelerating deep convolutional neural networks. IJCAI, 2234\u20132240 (2018)","DOI":"10.24963\/ijcai.2018\/309"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"He, Y., Liu, P., Wang, Z., Hu, Z., Yang, Y.: Filter pruning via geometric median for deep convolutional neural networks acceleration. In: IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 4335\u20134344 (2019)","DOI":"10.1109\/CVPR.2019.00447"},{"key":"12_CR9","unstructured":"Li, H., Kadav, A., Durdanovic, I., Samet, H., Graf, P.H.: Pruning filters for efficient ConvNets. In: International Conference on Learning Representations (2017)"},{"key":"12_CR10","unstructured":"Liebenwein, L., Baykal, C., Lang, H., Feldman, D., Rus, D.: Provable filter pruning for efficient neural networks. ICLR (2020)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Lin, M., Cao, L., Zhang, Y., Shao, L., Lin, C.W., Ji, R.: Pruning networks with cross-layer ranking & k-reciprocal nearest filters. IEEE Trans. Neural Netw. Learn. Syst. (2022)","DOI":"10.1109\/TNNLS.2022.3156047"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Lin, M., et al.: HRank: filter pruning using high-rank feature map. In: 2020 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1526\u20131535 (2020)","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Lin, M., Ji, R., Zhang, Y., Zhang, B., Wu, Y., Tian, Y.: Channel pruning via automatic structure search. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI-20, pp. 673\u2013679. International Joint Conferences on Artificial Intelligence Organization (2020). main track","DOI":"10.24963\/ijcai.2020\/94"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"107461","DOI":"10.1016\/j.patcog.2020.107461","volume":"107","author":"JH Luo","year":"2020","unstructured":"Luo, J.H., Wu, J.: AutoPruner: an end-to-end trainable filter pruning method for efficient deep model inference. Pattern Recogn. 107, 107461 (2020)","journal-title":"Pattern Recogn."},{"key":"12_CR15","unstructured":"Rachwan, J., Z\u00fcgner, D., Charpentier, B., Geisler, S., Ayle, M., G\u00fcnnemann, S.: Winning the lottery ahead of time: efficient early network pruning. In: International Conference on Machine Learning, pp. 18293\u201318309 (2022)"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1109\/TITS.2017.2750080","volume":"19","author":"E Romera","year":"2018","unstructured":"Romera, E., Alvarez, J.M., Bergasa, L.M., Arroyo, R.: ERFNet: efficient residual factorized ConvNet for real-time semantic segmentation. IEEE Trans. Intell. Transp. Syst. 19(1), 263\u2013272 (2018)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"12_CR17","unstructured":"Saxe, A., McClelland, J., Ganguli, S.: Exact solutions to the nonlinear dynamics of learning in deep linear neural networks. In: International Conference on Learning Represenatations (2014)"},{"issue":"7","key":"12_CR18","first-page":"8936","volume":"45","author":"X Su","year":"2023","unstructured":"Su, X., et al.: Searching for network width with bilaterally coupled network. IEEE Trans. Pattern Anal. Mach. Intell. 45(7), 8936\u20138953 (2023)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"12_CR19","unstructured":"Wang, H., Fu, Y.: Trainability preserving neural pruning. In: The Eleventh International Conference on Learning Representations (2023)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-030-58580-8_35","volume-title":"Computer Vision \u2013 ECCV 2020","author":"X Ning","year":"2020","unstructured":"Ning, X., Zhao, T., Li, W., Lei, P., Wang, Yu., Yang, H.: DSA: more efficient budgeted pruning via differentiable sparsity allocation. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.-M. (eds.) ECCV 2020. LNCS, vol. 12348, pp. 592\u2013607. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58580-8_35"},{"key":"12_CR21","unstructured":"Zhang, Y., et al.: Learning best combination for efficient n:M sparsity. In: Oh, A.H., Agarwal, A., Belgrave, D., Cho, K. (eds.) Advances in Neural Information Processing Systems (2022)"},{"key":"12_CR22","unstructured":"Zhou, A., et al.: Learning n: M fine-grained structured sparse neural networks from scratch. ICLR (2021)"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8549-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T18:08:35Z","timestamp":1703441315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8549-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,25]]},"ISBN":["9789819985487","9789819985494"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8549-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,25]]},"assertion":[{"value":"25 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chinese Conference on Pattern Recognition and Computer Vision  (PRCV)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ccprcv2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/prcv2023.xmu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1420","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"532","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,78","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,69","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}