{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:05Z","timestamp":1740145145749,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:00:00Z","timestamp":1704931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:00:00Z","timestamp":1704931200000},"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":["Optim Lett"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s11590-023-02084-8","type":"journal-article","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T18:02:21Z","timestamp":1704996141000},"page":"2079-2090","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Determining optimal channel partition for 2:4 fine grained structured sparsity"],"prefix":"10.1007","volume":"18","author":[{"given":"Mohit","family":"Mahajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Mei","family":"Hwu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4022-6277","authenticated-orcid":false,"given":"Rakesh","family":"Nagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,11]]},"reference":[{"key":"2084_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.15388\/20-INFOR391","volume":"31","author":"SM Al-Ykoob","year":"2020","unstructured":"Al-Ykoob, S.M., Sherali, H.D.: A complementary column generation approach for the graph equipartition problem. Informatica 31, 1\u201320 (2020)","journal-title":"Informatica"},{"issue":"3","key":"2084_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3005348","volume":"13","author":"S Anwar","year":"2017","unstructured":"Anwar, S., Hwang, K., Sung, W.: Structured pruning of deep convolutional neural networks. J. Emerg. Technol. Comput. Syst. 13(3), 1 (2017)","journal-title":"J. Emerg. Technol. Comput. Syst."},{"issue":"3","key":"2084_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3), 316\u2013329 (1998)","journal-title":"Oper. Res."},{"key":"2084_CR5","unstructured":"Bertsimas, D.: Introduction to linear optimization. Athena Scientific series in optimization and neural computation. Athena Scientific, Belmont, Mass (1997\u20131997)"},{"key":"2084_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co., USA (1990)"},{"issue":"1","key":"2084_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s11590-008-0097-2","volume":"3","author":"A Ghoniem","year":"2009","unstructured":"Ghoniem, A., Sherali, H.D.: Complementary column generation and bounding approaches for set partitioning formulations. Optim. Lett. 3(1), 123\u2013136 (2009)","journal-title":"Optim. Lett."},{"key":"2084_CR8","unstructured":"Han, S., Pool, J., Tran, J., Dally, W.J.: Learning both weights and connections for efficient neural networks. In: Proc. of the 28th Intl. Conference on Neural Information Processing Systems\u2014Volume 1, NIPS\u201915, p. 1135\u20131143. MIT Press, Cambridge, MA, USA (2015)"},{"key":"2084_CR9","doi-asserted-by":"crossref","unstructured":"Hestness, J., Ardalani, N., Diamos, G.: Beyond human-level accuracy: Computational challenges in deep learning. In: Proc. of the 24th Symposium on principles and practice of parallel programming, PPoPP \u201919, p. 1-14. Association for Computing Machinery, New York, NY, USA (2019)","DOI":"10.1145\/3293883.3295710"},{"key":"2084_CR10","doi-asserted-by":"crossref","unstructured":"Lee, E., Lee, C.Y.: Neuralscale: Efficient scaling of neurons for resource-constrained deep neural networks. In: Proc. of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 1478\u20131487 (2020)","DOI":"10.1109\/CVPR42600.2020.00155"},{"key":"2084_CR11","doi-asserted-by":"crossref","unstructured":"Li, Y., Gu, S., Mayer, C., Van\u00a0Gool, L., Timofte, R.: Group sparsity: The hinge between filter pruning and decomposition for network compression. In: Proc. of the IEEE international conf. on computer vision (2020)","DOI":"10.1109\/CVPR42600.2020.00804"},{"key":"2084_CR12","unstructured":"Mishra, A., Latorre, J.A., Pool, J., Stosic, D., Stosic, D., Venkatesh, G., Yu, C., Micikevicius, P.: Accelerating sparse deep neural networks (2021)"},{"key":"2084_CR1","unstructured":"NVIDIA apex library. https:\/\/github.com\/NVIDIA\/apex"},{"key":"2084_CR13","unstructured":"NVIDIA: Nvidia a100 tensor core gpu architecture (2020). Whitepaper at https:\/\/images.nvidia.com\/aem-dam\/en-zz\/Solutions\/data-center\/nvidia-ampere-architecture-whitepaper.pdf"},{"key":"2084_CR14","unstructured":"Pool, J., Yu, C.: Channel permutations for n:m sparsity. In: Advances in neural information processing systems, pp. 13316\u201313327 (2021)"},{"issue":"6","key":"2084_CR15","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831\u2013841 (1997)","journal-title":"Oper. Res."},{"key":"2084_CR16","unstructured":"Zhou, A., Ma, Y., Zhu, J., Liu, J., Zhang, Z., Yuan, K., Sun, W., Li, H.: Learning n:m fine-grained structured sparse neural networks from scratch (2021)"},{"key":"2084_CR17","unstructured":"Zhu, M., Gupta, S.: To prune, or not to prune: exploring the efficacy of pruning for model compression (2018). URL https:\/\/openreview.net\/forum?id=Sy1iIDkPM"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02084-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02084-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02084-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T10:27:39Z","timestamp":1728988059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02084-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,11]]},"references-count":17,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2084"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02084-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,1,11]]},"assertion":[{"value":"1 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}