{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:41:24Z","timestamp":1743097284716,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031539657"},{"type":"electronic","value":"9783031539664"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-3-031-53966-4_6","type":"book-chapter","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:02:29Z","timestamp":1707933749000},"page":"69-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Proximal Algorithm for\u00a0Network Slimming"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Bui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanghui","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fredrick","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingyong","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,15]]},"reference":[{"key":"6_CR1","unstructured":"Aghasi, A., Abdi, A., Nguyen, N., Romberg, J.: Net-trim: convex pruning of deep neural networks with performance guarantee. In: Advances in Neural Information Processing Systems, pp. 3177\u20133186 (2017)"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/19M1246468","volume":"2","author":"A Aghasi","year":"2020","unstructured":"Aghasi, A., Abdi, A., Romberg, J.: Fast convex pruning of deep neural networks. SIAM J. Math. Data Sci. 2(1), 158\u2013188 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"key":"6_CR3","unstructured":"Alvarez, J.M., Salzmann, M.: Learning the number of neurons in deep networks. In: Advances in Neural Information Processing Systems, pp. 2270\u20132278 (2016)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-order methods in optimization. SIAM (2017)","DOI":"10.1137\/1.9781611974997"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Bui, K., Park, F., Zhang, S., Qi, Y., Xin, J.: Nonconvex regularization for network slimming: compressing CNNs even more. In: Bebis, G., et al. (eds.) Advances in Visual Computing. ISVC 2020. LNCS, vol. 12509, pp. 39\u201353. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64556-4_4","DOI":"10.1007\/978-3-030-64556-4_4"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"115292","DOI":"10.1109\/ACCESS.2021.3105366","volume":"9","author":"K Bui","year":"2021","unstructured":"Bui, K., Park, F., Zhang, S., Qi, Y., Xin, J.: Improving network slimming with nonconvex regularization. IEEE Access 9, 115292\u2013115314 (2021)","journal-title":"IEEE Access"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Bui, K., Park, F., Zhang, S., Qi, Y., Xin, J.: Structured sparsity of convolutional neural networks via nonconvex sparse group regularization. Front. Appl. Math. Stat. (2021)","DOI":"10.3389\/fams.2020.529564"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Fu, Y., et al.: Exploring structural sparsity of deep networks via inverse scale spaces. IEEE Trans. Pattern Anal. Mach. Intell. (2022)","DOI":"10.1109\/TPAMI.2022.3168881"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Girshick, R., Donahue, J., Darrell, T., Malik, J.: Rich feature hierarchies for accurate object detection and semantic segmentation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 580\u2013587 (2014)","DOI":"10.1109\/CVPR.2014.81"},{"key":"6_CR11","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, pp. 1135\u20131143 (2015)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"6_CR13","unstructured":"Hu, H., Peng, R., Tai, Y.W., Tang, C.K.: Network trimming: a data-driven neuron pruning approach towards efficient deep architectures. arXiv preprint arXiv:1607.03250 (2016)"},{"key":"6_CR14","unstructured":"Huang, G., Liu, Z., Pleiss, G., Van Der Maaten, L., Weinberger, K.: Convolutional networks with dense connectivity. IEEE Trans. Pattern Anal. Mach. Intell. (2019)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Huang, G., Liu, Z., Van Der Maaten, L., Weinberger, K.Q.: Densely connected convolutional networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4700\u20134708 (2017)","DOI":"10.1109\/CVPR.2017.243"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Huang, J., et al.: Speed\/accuracy trade-offs for modern convolutional object detectors. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 7310\u20137311 (2017)","DOI":"10.1109\/CVPR.2017.351"},{"key":"6_CR17","unstructured":"Ioffe, S., Szegedy, C.: Batch normalization: accelerating deep network training by reducing internal covariate shift. In: International Conference on Machine Learning, pp. 448\u2013456 (2015)"},{"key":"6_CR18","unstructured":"Krizhevsky, A., Hinton, G., et al.: Learning multiple layers of features from tiny images. Technical report, University of Toronto (2009)"},{"key":"6_CR19","unstructured":"Li, H., Kadav, A., Durdanovic, I., Samet, H., Graf, H.P.: Pruning filters for efficient convnets. arXiv preprint arXiv:1608.08710 (2016)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Li, Y., Gu, S., Mayer, C., Gool, L.V., Timofte, R.: Group sparsity: the hinge between filter pruning and decomposition for network compression. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), June 2020","DOI":"10.1109\/CVPR42600.2020.00804"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Lin, M., et al.: Hrank: filter pruning using high-rank feature map. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 1529\u20131538 (2020)","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Lin, S., et al.: Towards optimal structured CNN pruning via generative adversarial learning. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 2790\u20132799 (2019)","DOI":"10.1109\/CVPR.2019.00290"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Liu, Z., Li, J., Shen, Z., Huang, G., Yan, S., Zhang, C.: Learning efficient convolutional networks through network slimming. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2736\u20132744 (2017)","DOI":"10.1109\/ICCV.2017.298"},{"key":"6_CR24","first-page":"17629","volume":"33","author":"F Meng","year":"2020","unstructured":"Meng, F., et al.: Pruning filter in filter. Adv. Neural Inf. Process. Syst. 33, 17629\u201317640 (2020)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10957-013-0391-8","volume":"160","author":"D Noll","year":"2014","unstructured":"Noll, D.: Convergence of non-smooth descent methods using the Kurdyka-\u0141ojasiewicz inequality. J. Optim. Theory Appl. 160(2), 553\u2013572 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"6_CR26","unstructured":"Ren, S., He, K., Girshick, R., Sun, J.: Faster R-CNN: towards real-time object detection with region proposal networks. In: Advances in Neural Information Processing Systems, pp. 91\u201399 (2015)"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer Science & Business Media, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02431-3","DOI":"10.1007\/978-3-642-02431-3"},{"key":"6_CR28","unstructured":"Santurkar, S., Tsipras, D., Ilyas, A., Madry, A.: How does batch normalization help optimization? Adv. Neural Inf. Process. Syst. 31 (2018)"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.neucom.2017.02.029","volume":"241","author":"S Scardapane","year":"2017","unstructured":"Scardapane, S., Comminiello, D., Hussain, A., Uncini, A.: Group sparse regularization for deep neural networks. Neurocomputing 241, 81\u201389 (2017)","journal-title":"Neurocomputing"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Shen, M., Molchanov, P., Yin, H., Alvarez, J.M.: When to prune? A policy towards early structural pruning. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 12247\u201312256 (2022)","DOI":"10.1109\/CVPR52688.2022.01193"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Shor, N.Z.: Minimization Methods for Non-Differentiable Functions, vol. 3. Springer Science & Business Media, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-82118-9","DOI":"10.1007\/978-3-642-82118-9"},{"key":"6_CR32","unstructured":"Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014)"},{"key":"6_CR33","unstructured":"Wen, W., Wu, C., Wang, Y., Chen, Y., Li, H.: Learning structured sparsity in deep neural networks. In: Advances in Neural Information Processing Systems, pp. 2074\u20132082 (2016)"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"65901","DOI":"10.1109\/ACCESS.2022.3185095","volume":"10","author":"F Xue","year":"2022","unstructured":"Xue, F., Qi, Y., Xin, J.: RARTS: an efficient first-order relaxed architecture search method. IEEE Access 10, 65901\u201365912 (2022)","journal-title":"IEEE Access"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Xue, F., Xin, J.: Network compression via cooperative architecture search and distillation. In: IEEE International Conference on AI for Industries, pp. 42\u201343 (2021)","DOI":"10.1109\/AI4I51902.2021.00018"},{"issue":"1","key":"6_CR36","doi-asserted-by":"publisher","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37(1), A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Zagoruyko, S., Komodakis, N.: Wide residual networks. arXiv preprint arXiv:1605.07146 (2016)","DOI":"10.5244\/C.30.87"},{"key":"6_CR38","unstructured":"Zeng, J., Lau, T.T.K., Lin, S., Yao, Y.: Global convergence of block coordinate descent in deep learning. In: International Conference on Machine Learning, pp. 7313\u20137323. PMLR (2019)"},{"issue":"1","key":"6_CR39","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-018-1236-x","volume":"169","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Xin, J.: Minimization of transformed $$l_1$$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing. Math. Program. 169(1), 307\u2013336 (2018)","journal-title":"Math. Program."},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Zhao, C., Ni, B., Zhang, J., Zhao, Q., Zhang, W., Tian, Q.: Variational convolutional neural network pruning. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 2780\u20132789 (2019)","DOI":"10.1109\/CVPR.2019.00289"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53966-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:03:14Z","timestamp":1707933794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53966-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031539657","9783031539664"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53966-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"15 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grasmere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"22 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2023.icas.cc\/","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":"In-house system and EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"72","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":"61% - 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":"5-6","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":"1-2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}